./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-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.7.1.ufo.BOUNDED-14.pals.c.v+sep-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 f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:45:07,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:45:07,582 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:45:07,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:45:07,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:45:07,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:45:07,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:45:07,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:45:07,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:45:07,616 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:45:07,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:45:07,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:45:07,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:45:07,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:45:07,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:45:07,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:45:07,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:45:07,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:07,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:45:07,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:45:07,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:45:07,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:45:07,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:45:07,622 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 -> f8b90978b682a83c8f6f0d2fe75b83e30918fdef6451144e6a40fff2a4b9e706 [2025-02-05 16:45:07,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:45:07,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:45:07,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:45:07,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:45:07,929 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:45:07,932 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2025-02-05 16:45:09,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/939e5993a/5f396f5dccae49a187bf86b04cd1be64/FLAGfa72fa9e2 [2025-02-05 16:45:09,791 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:45:09,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2025-02-05 16:45:09,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/939e5993a/5f396f5dccae49a187bf86b04cd1be64/FLAGfa72fa9e2 [2025-02-05 16:45:09,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/939e5993a/5f396f5dccae49a187bf86b04cd1be64 [2025-02-05 16:45:09,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:45:09,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:45:09,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:09,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:45:09,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:45:09,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:09" (1/1) ... [2025-02-05 16:45:09,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5aff80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:09, skipping insertion in model container [2025-02-05 16:45:09,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:45:09" (1/1) ... [2025-02-05 16:45:10,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:45:10,922 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2025-02-05 16:45:11,079 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2025-02-05 16:45:11,139 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2025-02-05 16:45:11,168 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2025-02-05 16:45:11,183 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2025-02-05 16:45:11,191 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2025-02-05 16:45:11,198 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2025-02-05 16:45:11,300 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2025-02-05 16:45:11,352 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2025-02-05 16:45:11,405 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2025-02-05 16:45:11,420 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2025-02-05 16:45:11,428 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2025-02-05 16:45:11,436 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2025-02-05 16:45:11,484 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2025-02-05 16:45:11,512 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2025-02-05 16:45:11,527 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2025-02-05 16:45:11,536 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2025-02-05 16:45:11,544 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2025-02-05 16:45:11,574 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2025-02-05 16:45:11,590 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2025-02-05 16:45:11,598 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2025-02-05 16:45:11,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2025-02-05 16:45:11,614 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2025-02-05 16:45:11,621 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2025-02-05 16:45:11,629 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2025-02-05 16:45:11,636 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2025-02-05 16:45:11,644 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2025-02-05 16:45:11,652 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2025-02-05 16:45:11,660 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2025-02-05 16:45:11,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:11,763 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:45:12,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[172160,172173] [2025-02-05 16:45:12,153 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[250199,250212] [2025-02-05 16:45:12,209 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[289422,289435] [2025-02-05 16:45:12,239 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[309133,309146] [2025-02-05 16:45:12,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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[319011,319024] [2025-02-05 16:45:12,263 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[323922,323935] [2025-02-05 16:45:12,272 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[328750,328763] [2025-02-05 16:45:12,377 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[405185,405198] [2025-02-05 16:45:12,432 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[443553,443566] [2025-02-05 16:45:12,460 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[463065,463078] [2025-02-05 16:45:12,476 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[472989,473002] [2025-02-05 16:45:12,484 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[477943,477956] [2025-02-05 16:45:12,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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[482814,482827] [2025-02-05 16:45:12,547 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[521320,521333] [2025-02-05 16:45:12,575 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[540838,540851] [2025-02-05 16:45:12,590 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[550762,550775] [2025-02-05 16:45:12,598 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[555716,555729] [2025-02-05 16:45:12,605 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[560575,560588] [2025-02-05 16:45:12,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[581321,581334] [2025-02-05 16:45:12,674 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[591188,591201] [2025-02-05 16:45:12,682 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[596115,596128] [2025-02-05 16:45:12,689 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[600957,600970] [2025-02-05 16:45:12,696 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[606379,606392] [2025-02-05 16:45:12,703 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[611215,611228] [2025-02-05 16:45:12,710 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[616142,616155] [2025-02-05 16:45:12,717 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[620984,620997] [2025-02-05 16:45:12,726 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[626027,626040] [2025-02-05 16:45:12,734 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[631036,631049] [2025-02-05 16:45:12,741 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.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c[635974,635987] [2025-02-05 16:45:12,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:45:12,813 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:45:12,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12 WrapperNode [2025-02-05 16:45:12,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:45:12,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:12,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:45:12,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:45:12,820 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:45:12" (1/1) ... [2025-02-05 16:45:12,898 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:45:12" (1/1) ... [2025-02-05 16:45:13,223 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28257 [2025-02-05 16:45:13,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:45:13,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:45:13,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:45:13,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:45:13,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,589 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:45:13,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:45:13,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:45:13,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:45:13,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:45:13,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (1/1) ... [2025-02-05 16:45:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:45:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:45:13,912 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:45:13,917 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:45:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:45:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:45:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:45:13,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:45:14,417 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:45:14,419 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:45:23,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21112: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~83#1; [2025-02-05 16:45:23,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20588: havoc main_~check__tmp~68#1;havoc main_~node7__m7~81#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~67#1; [2025-02-05 16:45:23,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22704: havoc main_~check__tmp~79#1;havoc main_~node7__m7~90#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~78#1; [2025-02-05 16:45:23,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30105: havoc main_~node7__m7~121#1;havoc main_~node6__m6~102#1;havoc main_~node5__m5~92#1;havoc main_~node4__m4~87#1;havoc main_~node3__m3~84#1;havoc main_~node2__m2~83#1;havoc main_~node1__m1~82#1;havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~108#1; [2025-02-05 16:45:23,263 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21649: havoc main_~check__tmp~73#1;havoc main_~node7__m7~85#1;havoc main_~node6__m6~72#1;havoc main_~node5__m5~65#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~72#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8438: havoc main_~node7__m7~30#1;havoc main_~node6__m6~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29580: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~100#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29052: havoc main_~check__tmp~104#1;havoc main_~node7__m7~117#1;havoc main_~node6__m6~98#1;havoc main_~node5__m5~88#1;havoc main_~node4__m4~83#1;havoc main_~node3__m3~81#1;havoc main_~node2__m2~80#1;havoc main_~node1__m1~79#1;havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~103#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8969: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~32#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46499: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28001: havoc main_~check__tmp~99#1;havoc main_~node7__m7~112#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~85#1;havoc main_~node4__m4~80#1;havoc main_~node3__m3~78#1;havoc main_~node2__m2~77#1;havoc main_~node1__m1~76#1;havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~98#1; [2025-02-05 16:45:23,264 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9506: havoc main_~check__tmp~25#1;havoc main_~node7__m7~34#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L27481: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~110#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11097: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~35#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29597: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~119#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10572: havoc main_~node7__m7~39#1;havoc main_~node6__m6~33#1;havoc main_~node5__m5~30#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~28#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25904: havoc main_~node7__m7~103#1;havoc main_~node6__m6~87#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~74#1;havoc main_~node3__m3~72#1;havoc main_~node2__m2~71#1;havoc main_~node1__m1~70#1;havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~91#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25379: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~85#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24851: havoc main_~node7__m7~99#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~75#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~69#1;havoc main_~node2__m2~68#1;havoc main_~node1__m1~67#1;havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~88#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26966: havoc main_~node7__m7~108#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~82#1;havoc main_~node4__m4~77#1;havoc main_~node3__m3~75#1;havoc main_~node2__m2~74#1;havoc main_~node1__m1~73#1;havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~95#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3713: havoc main_~node7__m7~10#1;havoc main_~node6__m6~9#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:45:23,265 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2657: havoc main_~node7__m7~6#1;havoc main_~node6__m6~6#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:45:23,266 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11114: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~41#1; [2025-02-05 16:45:23,266 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46527: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:45:23,266 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11651: havoc main_~check__tmp~33#1;havoc main_~node7__m7~43#1;havoc main_~node6__m6~37#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~32#1; [2025-02-05 16:45:23,266 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25396: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~101#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40724: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~119#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3203: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~8#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40741: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~126#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46555: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13797: havoc main_~node7__m7~52#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~41#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12741: havoc main_~node7__m7~48#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~38#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40758: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~140#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L38655: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~158#1; [2025-02-05 16:45:23,267 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13287: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~50#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46583: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5888: havoc main_~node7__m7~19#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~15#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44999: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~155#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5361: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~15#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4833: havoc main_~node7__m7~15#1;havoc main_~node6__m6~13#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15404: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~45#1; [2025-02-05 16:45:23,268 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14876: havoc main_~node7__m7~57#1;havoc main_~node6__m6~48#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~44#1; [2025-02-05 16:45:23,269 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40775: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~167#1; [2025-02-05 16:45:23,269 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40247: havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~158#1;havoc main_~node7__m7~165#1;havoc main_~node6__m6~138#1;havoc main_~node5__m5~124#1;havoc main_~node4__m4~117#1;havoc main_~node3__m3~114#1;havoc main_~node2__m2~112#1;havoc main_~node1__m1~111#1;havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~157#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L39195: havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~152#1;havoc main_~node7__m7~160#1;havoc main_~node6__m6~134#1;havoc main_~node5__m5~121#1;havoc main_~node4__m4~114#1;havoc main_~node3__m3~111#1;havoc main_~node2__m2~109#1;havoc main_~node1__m1~108#1;havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~151#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L34442: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~140#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36559: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~125#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1148: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L38144: havoc main_~node7__m7~156#1;havoc main_~node6__m6~131#1;havoc main_~node5__m5~118#1;havoc main_~node4__m4~111#1;havoc main_~node3__m3~108#1;havoc main_~node2__m2~106#1;havoc main_~node1__m1~105#1;havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~146#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15948: havoc main_~node7__m7~61#1;havoc main_~node6__m6~52#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~48#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23876: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~65#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L45016: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~185#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5378: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~17#1; [2025-02-05 16:45:23,270 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15421: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~50#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42908: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~176#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L34983: havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~133#1;havoc main_~node7__m7~142#1;havoc main_~node6__m6~119#1;havoc main_~node5__m5~107#1;havoc main_~node4__m4~101#1;havoc main_~node3__m3~98#1;havoc main_~node2__m2~97#1;havoc main_~node1__m1~96#1;havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~132#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17543: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~68#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37099: havoc main_~check__tmp~141#1;havoc main_~node7__m7~151#1;havoc main_~node6__m6~127#1;havoc main_~node5__m5~114#1;havoc main_~node4__m4~108#1;havoc main_~node3__m3~105#1;havoc main_~node2__m2~103#1;havoc main_~node1__m1~102#1;havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~140#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32344: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~99#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17018: havoc main_~node7__m7~66#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~50#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36576: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~149#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23893: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~66#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L45562: havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1;havoc main_~node7__m7~187#1;havoc main_~node6__m6~157#1;havoc main_~node5__m5~141#1;havoc main_~node4__m4~133#1;havoc main_~node3__m3~129#1;havoc main_~node2__m2~127#1;havoc main_~node1__m1~126#1;havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15438: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~59#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43449: havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1;havoc main_~node7__m7~178#1;havoc main_~node6__m6~149#1;havoc main_~node5__m5~134#1;havoc main_~node4__m4~127#1;havoc main_~node3__m3~123#1;havoc main_~node2__m2~121#1;havoc main_~node1__m1~120#1;havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-02-05 16:45:23,271 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36051: havoc main_~node7__m7~147#1;havoc main_~node6__m6~123#1;havoc main_~node5__m5~111#1;havoc main_~node4__m4~105#1;havoc main_~node3__m3~102#1;havoc main_~node2__m2~100#1;havoc main_~node1__m1~99#1;havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~136#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18083: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~58#1;havoc main_~node7__m7~70#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~57#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1705: havoc main_~node7____CPAchecker_TMP_0~1#1;havoc main_~node7__m7~2#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32361: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~110#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19681: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~65#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23910: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~68#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19156: havoc main_~node7__m7~75#1;havoc main_~node6__m6~63#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~54#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~61#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33957: havoc main_~check__tmp~127#1;havoc main_~node7__m7~138#1;havoc main_~node6__m6~116#1;havoc main_~node5__m5~104#1;havoc main_~node4__m4~98#1;havoc main_~node3__m3~95#1;havoc main_~node2__m2~94#1;havoc main_~node1__m1~93#1;havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~126#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44528: havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1;havoc main_~node7__m7~183#1;havoc main_~node6__m6~153#1;havoc main_~node5__m5~138#1;havoc main_~node4__m4~130#1;havoc main_~node3__m3~126#1;havoc main_~node2__m2~124#1;havoc main_~node1__m1~123#1;havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8060: havoc main_~node7__m7~28#1;havoc main_~node6__m6~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32901: havoc main_~check__tmp~121#1;havoc main_~node7__m7~133#1;havoc main_~node6__m6~112#1;havoc main_~node5__m5~101#1;havoc main_~node4__m4~95#1;havoc main_~node3__m3~92#1;havoc main_~node2__m2~91#1;havoc main_~node1__m1~90#1;havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~120#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7004: havoc main_~node7__m7~24#1;havoc main_~node6__m6~21#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21804: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~86#1; [2025-02-05 16:45:23,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21279: havoc main_~node7__m7~84#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~71#1; [2025-02-05 16:45:23,275 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32378: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~131#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23394: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~83#1;havoc main_~node7__m7~93#1;havoc main_~node6__m6~78#1;havoc main_~node5__m5~70#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~82#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31853: havoc main_~check__tmp~116#1;havoc main_~node7__m7~129#1;havoc main_~node6__m6~108#1;havoc main_~node5__m5~97#1;havoc main_~node4__m4~92#1;havoc main_~node3__m3~89#1;havoc main_~node2__m2~88#1;havoc main_~node1__m1~87#1;havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~115#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42423: havoc main_~check__tmp~170#1;havoc main_~node7__m7~174#1;havoc main_~node6__m6~146#1;havoc main_~node5__m5~131#1;havoc main_~node4__m4~124#1;havoc main_~node3__m3~120#1;havoc main_~node2__m2~118#1;havoc main_~node1__m1~117#1;havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~169#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19698: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~77#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L41367: havoc main_~check__tmp~164#1;havoc main_~node7__m7~169#1;havoc main_~node6__m6~142#1;havoc main_~node5__m5~128#1;havoc main_~node4__m4~121#1;havoc main_~node3__m3~117#1;havoc main_~node2__m2~115#1;havoc main_~node1__m1~114#1;havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~163#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23927: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~72#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22344: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~77#1;havoc main_~node7__m7~88#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~63#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~76#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30802: havoc main_~check__tmp~111#1;havoc main_~node7__m7~124#1;havoc main_~node6__m6~104#1;havoc main_~node5__m5~94#1;havoc main_~node4__m4~89#1;havoc main_~node3__m3~86#1;havoc main_~node2__m2~85#1;havoc main_~node1__m1~84#1;havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~110#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28159: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~95#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7550: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~26#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20235: havoc main_~check__tmp~66#1;havoc main_~node7__m7~79#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~60#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~65#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9667: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~27#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9139: havoc main_~node7__m7~33#1;havoc main_~node6__m6~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30282: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~122#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28699: havoc main_~check__tmp~102#1;havoc main_~node7__m7~115#1;havoc main_~node6__m6~97#1;havoc main_~node5__m5~87#1;havoc main_~node4__m4~82#1;havoc main_~node3__m3~80#1;havoc main_~node2__m2~79#1;havoc main_~node1__m1~78#1;havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~101#1; [2025-02-05 16:45:23,276 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23944: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~80#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: havoc main_~node7__m7~4#1;havoc main_~node6__m6~4#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28176: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~113#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L27651: havoc main_~node7__m7~111#1;havoc main_~node6__m6~93#1;havoc main_~node5__m5~84#1;havoc main_~node4__m4~79#1;havoc main_~node3__m3~77#1;havoc main_~node2__m2~76#1;havoc main_~node1__m1~75#1;havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~97#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10211: havoc main_~node7__m7~37#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~27#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29767: havoc main_~node7__m7~120#1;havoc main_~node6__m6~101#1;havoc main_~node5__m5~91#1;havoc main_~node4__m4~86#1;havoc main_~node3__m3~83#1;havoc main_~node2__m2~82#1;havoc main_~node1__m1~81#1;havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~107#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9684: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~30#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26601: havoc main_~check__tmp~94#1;havoc main_~node7__m7~106#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~80#1;havoc main_~node4__m4~76#1;havoc main_~node3__m3~74#1;havoc main_~node2__m2~73#1;havoc main_~node1__m1~72#1;havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~93#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24488: havoc main_~node7__m7~97#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~68#1;havoc main_~node2__m2~67#1;havoc main_~node1__m1~66#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~87#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23961: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~95#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11806: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~44#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11281: havoc main_~node7__m7~42#1;havoc main_~node6__m6~36#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~31#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26081: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~104#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9701: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~35#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12346: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~37#1;havoc main_~node7__m7~46#1;havoc main_~node6__m6~39#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~36#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25566: havoc main_~node7__m7~102#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~73#1;havoc main_~node3__m3~71#1;havoc main_~node2__m2~70#1;havoc main_~node1__m1~69#1;havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~90#1; [2025-02-05 16:45:23,277 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3376: havoc main_~node7__m7~9#1;havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3907: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~9#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3924: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~10#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L39341: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~135#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4468: havoc main_~node7__m7~13#1;havoc main_~node6__m6~12#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3941: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~11#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L45695: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~188#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14515: havoc main_~node7__m7~55#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~43#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35128: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~99#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13988: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~45#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13460: havoc main_~node7__m7~51#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~40#1; [2025-02-05 16:45:23,278 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L39358: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~161#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43588: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~135#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37254: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~152#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L39898: havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~156#1;havoc main_~node7__m7~163#1;havoc main_~node6__m6~137#1;havoc main_~node5__m5~123#1;havoc main_~node4__m4~116#1;havoc main_~node3__m3~113#1;havoc main_~node2__m2~111#1;havoc main_~node1__m1~110#1;havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~155#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35145: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~102#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46244: havoc main_~node1__m1~129#1;havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1;havoc main_~node7__m7~190#1;havoc main_~node6__m6~159#1;havoc main_~node5__m5~143#1;havoc main_~node4__m4~135#1;havoc main_~node3__m3~131#1;havoc main_~node2__m2~129#1;havoc main_~node1__m1~128#1;havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5548: havoc main_~node7__m7~18#1;havoc main_~node6__m6~16#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14005: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~53#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18234: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~51#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6079: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~20#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43605: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~150#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37794: havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~145#1;havoc main_~node7__m7~154#1;havoc main_~node6__m6~129#1;havoc main_~node5__m5~116#1;havoc main_~node4__m4~110#1;havoc main_~node3__m3~107#1;havoc main_~node2__m2~105#1;havoc main_~node1__m1~104#1;havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~144#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L38853: havoc main_~check__tmp~150#1;havoc main_~node7__m7~159#1;havoc main_~node6__m6~133#1;havoc main_~node5__m5~120#1;havoc main_~node4__m4~113#1;havoc main_~node3__m3~110#1;havoc main_~node2__m2~108#1;havoc main_~node1__m1~107#1;havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~149#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6616: havoc main_~check__tmp~16#1;havoc main_~node7__m7~22#1;havoc main_~node6__m6~19#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36743: havoc main_~node7__m7~150#1;havoc main_~node6__m6~126#1;havoc main_~node5__m5~113#1;havoc main_~node4__m4~107#1;havoc main_~node3__m3~104#1;havoc main_~node2__m2~102#1;havoc main_~node1__m1~101#1;havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~139#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35162: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~108#1; [2025-02-05 16:45:23,279 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15608: havoc main_~node7__m7~60#1;havoc main_~node6__m6~51#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~47#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18251: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~54#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43622: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~179#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16139: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~62#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40982: havoc main_~check__tmp~162#1;havoc main_~node7__m7~168#1;havoc main_~node6__m6~141#1;havoc main_~node5__m5~127#1;havoc main_~node4__m4~120#1;havoc main_~node3__m3~116#1;havoc main_~node2__m2~114#1;havoc main_~node1__m1~113#1;havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~161#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33056: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~134#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22489: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~75#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16676: havoc main_~check__tmp~51#1;havoc main_~node7__m7~64#1;havoc main_~node6__m6~54#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~50#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35704: havoc main_~node7__m7~145#1;havoc main_~node6__m6~122#1;havoc main_~node5__m5~110#1;havoc main_~node4__m4~104#1;havoc main_~node3__m3~101#1;havoc main_~node2__m2~99#1;havoc main_~node1__m1~98#1;havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~135#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L34648: havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~131#1;havoc main_~node7__m7~141#1;havoc main_~node6__m6~118#1;havoc main_~node5__m5~106#1;havoc main_~node4__m4~100#1;havoc main_~node3__m3~97#1;havoc main_~node2__m2~96#1;havoc main_~node1__m1~95#1;havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~130#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35179: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~120#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46278: havoc main_~node2__m2~130#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18795: havoc main_~node7__m7~73#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~51#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~60#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L41522: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~170#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18268: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~60#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33596: havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~125#1;havoc main_~node7__m7~136#1;havoc main_~node6__m6~114#1;havoc main_~node5__m5~103#1;havoc main_~node4__m4~97#1;havoc main_~node3__m3~94#1;havoc main_~node2__m2~93#1;havoc main_~node1__m1~92#1;havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~124#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17741: havoc main_~check__tmp~56#1;havoc main_~node7__m7~69#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~55#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43114: havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1;havoc main_~node7__m7~177#1;havoc main_~node6__m6~148#1;havoc main_~node5__m5~133#1;havoc main_~node4__m4~126#1;havoc main_~node3__m3~122#1;havoc main_~node2__m2~120#1;havoc main_~node1__m1~119#1;havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-02-05 16:45:23,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32545: havoc main_~node7__m7~132#1;havoc main_~node6__m6~111#1;havoc main_~node5__m5~100#1;havoc main_~node4__m4~94#1;havoc main_~node3__m3~91#1;havoc main_~node2__m2~90#1;havoc main_~node1__m1~89#1;havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~119#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20390: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~80#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30960: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~105#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22506: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~89#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42062: havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~168#1;havoc main_~node7__m7~172#1;havoc main_~node6__m6~144#1;havoc main_~node5__m5~130#1;havoc main_~node4__m4~123#1;havoc main_~node3__m3~119#1;havoc main_~node2__m2~117#1;havoc main_~node1__m1~116#1;havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~167#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L45233: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1;havoc main_~node7__m7~186#1;havoc main_~node6__m6~156#1;havoc main_~node5__m5~140#1;havoc main_~node4__m4~132#1;havoc main_~node3__m3~128#1;havoc main_~node2__m2~126#1;havoc main_~node1__m1~125#1;havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19865: havoc main_~node7__m7~78#1;havoc main_~node6__m6~66#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~64#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44179: havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1;havoc main_~node7__m7~181#1;havoc main_~node6__m6~152#1;havoc main_~node5__m5~137#1;havoc main_~node4__m4~129#1;havoc main_~node3__m3~125#1;havoc main_~node2__m2~123#1;havoc main_~node1__m1~122#1;havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28854: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~116#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35196: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~143#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18285: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~71#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L20930: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~70#1;havoc main_~node7__m7~82#1;havoc main_~node6__m6~69#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~69#1; [2025-02-05 16:45:23,281 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31500: havoc main_~check__tmp~114#1;havoc main_~node7__m7~127#1;havoc main_~node6__m6~107#1;havoc main_~node5__m5~96#1;havoc main_~node4__m4~91#1;havoc main_~node3__m3~88#1;havoc main_~node2__m2~87#1;havoc main_~node1__m1~86#1;havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~113#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23046: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~81#1;havoc main_~node7__m7~91#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~80#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8778: havoc main_~node7__m7~31#1;havoc main_~node6__m6~27#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8251: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~25#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30977: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~125#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7723: havoc main_~node7__m7~27#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29394: havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~106#1;havoc main_~node7__m7~118#1;havoc main_~node6__m6~99#1;havoc main_~node5__m5~89#1;havoc main_~node4__m4~84#1;havoc main_~node3__m3~82#1;havoc main_~node2__m2~81#1;havoc main_~node1__m1~80#1;havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~105#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L30452: havoc main_~node7__m7~123#1;havoc main_~node6__m6~103#1;havoc main_~node5__m5~93#1;havoc main_~node4__m4~88#1;havoc main_~node3__m3~85#1;havoc main_~node2__m2~84#1;havoc main_~node1__m1~83#1;havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~109#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46310: havoc main_~node3__m3~132#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L28343: havoc main_~node7__m7~114#1;havoc main_~node6__m6~96#1;havoc main_~node5__m5~86#1;havoc main_~node4__m4~81#1;havoc main_~node3__m3~79#1;havoc main_~node2__m2~78#1;havoc main_~node1__m1~77#1;havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~100#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22002: havoc main_~check__tmp~75#1;havoc main_~node7__m7~87#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~74#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~3#1;havoc main_~node6__m6~3#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26762: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~81#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8268: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~29#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12500: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~33#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L27304: havoc main_~node7__m7~109#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~83#1;havoc main_~node4__m4~78#1;havoc main_~node3__m3~76#1;havoc main_~node2__m2~75#1;havoc main_~node1__m1~74#1;havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~96#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24134: havoc main_~node7__m7~96#1;havoc main_~node6__m6~81#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~66#1;havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~86#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2467: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~5#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26779: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~90#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26251: havoc main_~node7__m7~105#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~75#1;havoc main_~node3__m3~73#1;havoc main_~node2__m2~72#1;havoc main_~node1__m1~71#1;havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~92#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9871: havoc main_~node7__m7~36#1;havoc main_~node6__m6~31#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~26#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10402: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~38#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46342: havoc main_~node4__m4~136#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12517: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~34#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L890: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L25205: havoc main_~node7__m7~100#1;havoc main_~node6__m6~84#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~72#1;havoc main_~node3__m3~70#1;havoc main_~node2__m2~69#1;havoc main_~node1__m1~68#1;havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~89#1; [2025-02-05 16:45:23,282 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L24678: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~98#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3011: havoc main_~node7__m7~7#1;havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10939: havoc main_~check__tmp~30#1;havoc main_~node7__m7~40#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~29#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2484: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~5#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L26796: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~107#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12004: havoc main_~check__tmp~35#1;havoc main_~node7__m7~45#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12534: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~36#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46374: havoc main_~node5__m5~144#1; [2025-02-05 16:45:23,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12551: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L924: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40041: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~164#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L13095: havoc main_~node7__m7~49#1;havoc main_~node6__m6~42#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~39#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L12568: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~47#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5170: havoc main_~node7__m7~16#1;havoc main_~node6__m6~14#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L40582: havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~160#1;havoc main_~node7__m7~166#1;havoc main_~node6__m6~139#1;havoc main_~node5__m5~125#1;havoc main_~node4__m4~118#1;havoc main_~node3__m3~115#1;havoc main_~node2__m2~113#1;havoc main_~node1__m1~112#1;havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~159#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4114: havoc main_~node7__m7~12#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37943: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~117#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L958: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4660: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~14#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14175: havoc main_~node7__m7~54#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~42#1; [2025-02-05 16:45:23,284 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37960: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~130#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6249: havoc main_~node7__m7~21#1;havoc main_~node6__m6~18#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L14706: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~56#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6780: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~17#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L15243: havoc main_~check__tmp~46#1;havoc main_~node7__m7~58#1;havoc main_~node6__m6~49#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~45#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502: havoc main_~node7__m7~1#1;havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L39556: havoc main_~check__tmp~154#1;havoc main_~node7__m7~162#1;havoc main_~node6__m6~136#1;havoc main_~node5__m5~122#1;havoc main_~node4__m4~115#1;havoc main_~node3__m3~112#1;havoc main_~node2__m2~110#1;havoc main_~node1__m1~109#1;havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~153#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33742: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~115#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L38500: havoc main_~check__tmp~148#1;havoc main_~node7__m7~157#1;havoc main_~node6__m6~132#1;havoc main_~node5__m5~119#1;havoc main_~node4__m4~112#1;havoc main_~node3__m3~109#1;havoc main_~node2__m2~107#1;havoc main_~node1__m1~106#1;havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~147#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16834: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~55#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37977: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~155#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16309: havoc main_~node7__m7~63#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~45#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~49#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L45906: havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1;havoc main_~node7__m7~189#1;havoc main_~node6__m6~158#1;havoc main_~node5__m5~142#1;havoc main_~node4__m4~134#1;havoc main_~node3__m3~130#1;havoc main_~node2__m2~128#1;havoc main_~node1__m1~127#1;havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44322: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~182#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6797: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L37452: havoc main_~check__tmp~143#1;havoc main_~node7__m7~153#1;havoc main_~node6__m6~128#1;havoc main_~node5__m5~115#1;havoc main_~node4__m4~109#1;havoc main_~node3__m3~106#1;havoc main_~node2__m2~104#1;havoc main_~node1__m1~103#1;havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~142#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42208: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~145#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L36401: havoc main_~check__tmp~138#1;havoc main_~node7__m7~148#1;havoc main_~node6__m6~124#1;havoc main_~node5__m5~112#1;havoc main_~node4__m4~106#1;havoc main_~node3__m3~103#1;havoc main_~node2__m2~101#1;havoc main_~node1__m1~100#1;havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~137#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46443: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~160#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23188: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~92#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33759: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~137#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21078: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~63#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16851: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~65#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L44863: havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1;havoc main_~node7__m7~184#1;havoc main_~node6__m6~154#1;havoc main_~node5__m5~139#1;havoc main_~node4__m4~131#1;havoc main_~node3__m3~127#1;havoc main_~node2__m2~125#1;havoc main_~node1__m1~124#1;havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35881: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~146#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6814: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~20#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42225: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~173#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31655: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~128#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L23728: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~85#1;havoc main_~node7__m7~94#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~84#1; [2025-02-05 16:45:23,285 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L34299: havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~129#1;havoc main_~node7__m7~139#1;havoc main_~node6__m6~117#1;havoc main_~node5__m5~105#1;havoc main_~node4__m4~99#1;havoc main_~node3__m3~96#1;havoc main_~node2__m2~95#1;havoc main_~node1__m1~94#1;havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~128#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L17388: havoc main_~check__tmp~54#1;havoc main_~node7__m7~67#1;havoc main_~node6__m6~57#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29546: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~85#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L21095: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~70#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L42765: havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1;havoc main_~node7__m7~175#1;havoc main_~node6__m6~147#1;havoc main_~node5__m5~132#1;havoc main_~node4__m4~125#1;havoc main_~node3__m3~121#1;havoc main_~node2__m2~119#1;havoc main_~node1__m1~118#1;havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L35366: havoc main_~node7__m7~144#1;havoc main_~node6__m6~121#1;havoc main_~node5__m5~109#1;havoc main_~node4__m4~103#1;havoc main_~node3__m3~100#1;havoc main_~node2__m2~98#1;havoc main_~node1__m1~97#1;havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~134#1; [2025-02-05 16:45:23,286 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L32195: havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~118#1;havoc main_~node7__m7~130#1;havoc main_~node6__m6~109#1;havoc main_~node5__m5~98#1;havoc main_~node4__m4~93#1;havoc main_~node3__m3~90#1;havoc main_~node2__m2~89#1;havoc main_~node1__m1~88#1;havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~117#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18455: havoc main_~node7__m7~72#1;havoc main_~node6__m6~61#1;havoc main_~node5__m5~55#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~59#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L33254: havoc main_~check__tmp~123#1;havoc main_~node7__m7~135#1;havoc main_~node6__m6~113#1;havoc main_~node5__m5~102#1;havoc main_~node4__m4~96#1;havoc main_~node3__m3~93#1;havoc main_~node2__m2~92#1;havoc main_~node1__m1~91#1;havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~122#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7358: havoc main_~node7__m7~25#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L18986: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~74#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6831: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~23#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46471: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L31144: havoc main_~node7__m7~126#1;havoc main_~node6__m6~106#1;havoc main_~node5__m5~95#1;havoc main_~node4__m4~90#1;havoc main_~node3__m3~87#1;havoc main_~node2__m2~86#1;havoc main_~node1__m1~85#1;havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~112#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L29563: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~90#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L43834: havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1;havoc main_~node7__m7~180#1;havoc main_~node6__m6~151#1;havoc main_~node5__m5~136#1;havoc main_~node4__m4~128#1;havoc main_~node3__m3~124#1;havoc main_~node2__m2~122#1;havoc main_~node1__m1~121#1;havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L19523: havoc main_~check__tmp~63#1;havoc main_~node7__m7~76#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~62#1; [2025-02-05 16:45:23,287 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L41720: havoc main_~check__tmp~166#1;havoc main_~node7__m7~171#1;havoc main_~node6__m6~143#1;havoc main_~node5__m5~129#1;havoc main_~node4__m4~122#1;havoc main_~node3__m3~118#1;havoc main_~node2__m2~116#1;havoc main_~node1__m1~115#1;havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~165#1; [2025-02-05 16:45:24,421 INFO L? ?]: Removed 5967 outVars from TransFormulas that were not future-live. [2025-02-05 16:45:24,421 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:45:24,492 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:45:24,493 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:45:24,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:24 BoogieIcfgContainer [2025-02-05 16:45:24,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:45:24,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:45:24,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:45:24,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:45:24,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:45:09" (1/3) ... [2025-02-05 16:45:24,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60616afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:24, skipping insertion in model container [2025-02-05 16:45:24,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:45:12" (2/3) ... [2025-02-05 16:45:24,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60616afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:45:24, skipping insertion in model container [2025-02-05 16:45:24,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:45:24" (3/3) ... [2025-02-05 16:45:24,502 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c [2025-02-05 16:45:24,514 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:45:24,517 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+sep-reducer.c that has 1 procedures, 5467 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-02-05 16:45:24,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:45:24,658 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;@48c060e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:45:24,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-02-05 16:45:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 5467 states, 5437 states have (on average 1.7491263564465698) internal successors, (9510), 5466 states have internal predecessors, (9510), 0 states have call successors, (0), 0 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:45:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:45:24,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:24,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:24,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:24,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:24,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1969361954, now seen corresponding path program 1 times [2025-02-05 16:45:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162617516] [2025-02-05 16:45:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:45:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:45:25,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:25,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:25,481 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:45:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162617516] [2025-02-05 16:45:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162617516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773910137] [2025-02-05 16:45:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:25,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:25,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:25,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:25,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:25,515 INFO L87 Difference]: Start difference. First operand has 5467 states, 5437 states have (on average 1.7491263564465698) internal successors, (9510), 5466 states have internal predecessors, (9510), 0 states have call successors, (0), 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 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:28,399 INFO L93 Difference]: Finished difference Result 6608 states and 11352 transitions. [2025-02-05 16:45:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-05 16:45:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:28,450 INFO L225 Difference]: With dead ends: 6608 [2025-02-05 16:45:28,451 INFO L226 Difference]: Without dead ends: 3908 [2025-02-05 16:45:28,460 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:45:28,463 INFO L435 NwaCegarLoop]: 3584 mSDtfsCounter, 19818 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 3076 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19818 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:28,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19818 Valid, 3630 Invalid, 3115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3076 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 16:45:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2025-02-05 16:45:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3908. [2025-02-05 16:45:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3879 states have (on average 1.3044599123485434) internal successors, (5060), 3907 states have internal predecessors, (5060), 0 states have call successors, (0), 0 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:45:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5060 transitions. [2025-02-05 16:45:28,698 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5060 transitions. Word has length 102 [2025-02-05 16:45:28,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:28,703 INFO L471 AbstractCegarLoop]: Abstraction has 3908 states and 5060 transitions. [2025-02-05 16:45:28,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5060 transitions. [2025-02-05 16:45:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:45:28,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:28,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:28,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:45:28,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1522898207, now seen corresponding path program 1 times [2025-02-05 16:45:28,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:28,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818583972] [2025-02-05 16:45:28,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:28,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:45:28,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:45:28,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:29,100 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:45:29,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:29,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818583972] [2025-02-05 16:45:29,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818583972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:29,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:29,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:29,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152436617] [2025-02-05 16:45:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:29,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:29,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:29,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:29,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:29,103 INFO L87 Difference]: Start difference. First operand 3908 states and 5060 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:30,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:30,685 INFO L93 Difference]: Finished difference Result 4464 states and 5747 transitions. [2025-02-05 16:45:30,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:30,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-05 16:45:30,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:30,694 INFO L225 Difference]: With dead ends: 4464 [2025-02-05 16:45:30,694 INFO L226 Difference]: Without dead ends: 2572 [2025-02-05 16:45:30,696 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:45:30,698 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 9928 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9928 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:30,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9928 Valid, 1640 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:45:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2025-02-05 16:45:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2572. [2025-02-05 16:45:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 2543 states have (on average 1.3193079040503342) internal successors, (3355), 2571 states have internal predecessors, (3355), 0 states have call successors, (0), 0 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:45:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3355 transitions. [2025-02-05 16:45:30,737 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3355 transitions. Word has length 102 [2025-02-05 16:45:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 2572 states and 3355 transitions. [2025-02-05 16:45:30,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:30,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3355 transitions. [2025-02-05 16:45:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:45:30,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:30,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:30,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:45:30,744 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1327273136, now seen corresponding path program 1 times [2025-02-05 16:45:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717832556] [2025-02-05 16:45:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:30,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:45:30,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:45:30,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:30,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:31,011 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:45:31,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:31,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717832556] [2025-02-05 16:45:31,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717832556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:31,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:31,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784378233] [2025-02-05 16:45:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:31,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:31,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:31,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:31,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:31,013 INFO L87 Difference]: Start difference. First operand 2572 states and 3355 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:31,994 INFO L93 Difference]: Finished difference Result 3320 states and 4329 transitions. [2025-02-05 16:45:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-02-05 16:45:31,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:31,999 INFO L225 Difference]: With dead ends: 3320 [2025-02-05 16:45:31,999 INFO L226 Difference]: Without dead ends: 2036 [2025-02-05 16:45:32,001 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:45:32,001 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 7935 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7935 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:32,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7935 Valid, 1384 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:45:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2025-02-05 16:45:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2036. [2025-02-05 16:45:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 2007 states have (on average 1.336322869955157) internal successors, (2682), 2035 states have internal predecessors, (2682), 0 states have call successors, (0), 0 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:45:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2682 transitions. [2025-02-05 16:45:32,028 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2682 transitions. Word has length 102 [2025-02-05 16:45:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:32,028 INFO L471 AbstractCegarLoop]: Abstraction has 2036 states and 2682 transitions. [2025-02-05 16:45:32,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:45:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2682 transitions. [2025-02-05 16:45:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:45:32,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:32,031 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] [2025-02-05 16:45:32,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:45:32,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:32,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:32,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1477072390, now seen corresponding path program 1 times [2025-02-05 16:45:32,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:32,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540606758] [2025-02-05 16:45:32,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:32,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:45:32,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:45:32,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:32,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:32,236 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:45:32,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:32,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540606758] [2025-02-05 16:45:32,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540606758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:32,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:32,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:32,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346879978] [2025-02-05 16:45:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:32,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:32,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:32,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:32,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:32,239 INFO L87 Difference]: Start difference. First operand 2036 states and 2682 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:45:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:32,882 INFO L93 Difference]: Finished difference Result 2295 states and 2974 transitions. [2025-02-05 16:45:32,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:32,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-02-05 16:45:32,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:32,887 INFO L225 Difference]: With dead ends: 2295 [2025-02-05 16:45:32,887 INFO L226 Difference]: Without dead ends: 1347 [2025-02-05 16:45:32,888 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:45:32,888 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 5182 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:32,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 961 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:45:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-02-05 16:45:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1347. [2025-02-05 16:45:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1318 states have (on average 1.3482549317147192) internal successors, (1777), 1346 states have internal predecessors, (1777), 0 states have call successors, (0), 0 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:45:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1777 transitions. [2025-02-05 16:45:32,905 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1777 transitions. Word has length 104 [2025-02-05 16:45:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1777 transitions. [2025-02-05 16:45:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 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:45:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1777 transitions. [2025-02-05 16:45:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:45:32,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:32,908 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] [2025-02-05 16:45:32,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:45:32,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -864764634, now seen corresponding path program 1 times [2025-02-05 16:45:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506657884] [2025-02-05 16:45:32,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:32,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:45:32,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:45:32,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:32,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:33,131 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:45:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:33,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506657884] [2025-02-05 16:45:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506657884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260339784] [2025-02-05 16:45:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:33,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:33,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:33,133 INFO L87 Difference]: Start difference. First operand 1347 states and 1777 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:45:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:33,654 INFO L93 Difference]: Finished difference Result 1975 states and 2617 transitions. [2025-02-05 16:45:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:33,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-02-05 16:45:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:33,657 INFO L225 Difference]: With dead ends: 1975 [2025-02-05 16:45:33,657 INFO L226 Difference]: Without dead ends: 1249 [2025-02-05 16:45:33,658 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:45:33,658 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 4910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4910 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:33,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4910 Valid, 970 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:45:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-02-05 16:45:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2025-02-05 16:45:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1220 states have (on average 1.362295081967213) internal successors, (1662), 1248 states have internal predecessors, (1662), 0 states have call successors, (0), 0 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:45:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1662 transitions. [2025-02-05 16:45:33,671 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1662 transitions. Word has length 106 [2025-02-05 16:45:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:33,671 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1662 transitions. [2025-02-05 16:45:33,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:45:33,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1662 transitions. [2025-02-05 16:45:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 16:45:33,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:33,673 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] [2025-02-05 16:45:33,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:45:33,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:33,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash 488782681, now seen corresponding path program 1 times [2025-02-05 16:45:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978506398] [2025-02-05 16:45:33,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:33,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 16:45:33,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 16:45:33,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:33,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:33,916 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:45:33,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:33,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978506398] [2025-02-05 16:45:33,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978506398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:33,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:33,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501178889] [2025-02-05 16:45:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:33,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:33,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:33,918 INFO L87 Difference]: Start difference. First operand 1249 states and 1662 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:45:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:34,779 INFO L93 Difference]: Finished difference Result 2533 states and 3388 transitions. [2025-02-05 16:45:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:34,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-02-05 16:45:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:34,784 INFO L225 Difference]: With dead ends: 2533 [2025-02-05 16:45:34,784 INFO L226 Difference]: Without dead ends: 1854 [2025-02-05 16:45:34,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:45:34,785 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 6508 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6508 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:34,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6508 Valid, 1452 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2025-02-05 16:45:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1742. [2025-02-05 16:45:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1713 states have (on average 1.394045534150613) internal successors, (2388), 1741 states have internal predecessors, (2388), 0 states have call successors, (0), 0 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:45:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2388 transitions. [2025-02-05 16:45:34,818 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2388 transitions. Word has length 108 [2025-02-05 16:45:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:34,818 INFO L471 AbstractCegarLoop]: Abstraction has 1742 states and 2388 transitions. [2025-02-05 16:45:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:45:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2388 transitions. [2025-02-05 16:45:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:45:34,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:34,821 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] [2025-02-05 16:45:34,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:45:34,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:34,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash 843250693, now seen corresponding path program 1 times [2025-02-05 16:45:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786185423] [2025-02-05 16:45:34,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:34,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:45:34,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:45:34,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:34,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:34,995 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:45:34,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786185423] [2025-02-05 16:45:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786185423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:34,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:45:34,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025081064] [2025-02-05 16:45:34,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:45:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:34,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:45:34,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:45:34,997 INFO L87 Difference]: Start difference. First operand 1742 states and 2388 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:45:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:35,799 INFO L93 Difference]: Finished difference Result 2472 states and 3380 transitions. [2025-02-05 16:45:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:45:35,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-02-05 16:45:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:35,803 INFO L225 Difference]: With dead ends: 2472 [2025-02-05 16:45:35,803 INFO L226 Difference]: Without dead ends: 1734 [2025-02-05 16:45:35,804 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:45:35,805 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 4619 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4619 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:35,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4619 Valid, 770 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:45:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-02-05 16:45:35,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2025-02-05 16:45:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3941348973607037) internal successors, (2377), 1733 states have internal predecessors, (2377), 0 states have call successors, (0), 0 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:45:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2377 transitions. [2025-02-05 16:45:35,827 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2377 transitions. Word has length 110 [2025-02-05 16:45:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:35,827 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2377 transitions. [2025-02-05 16:45:35,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:45:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2377 transitions. [2025-02-05 16:45:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:45:35,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:35,830 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] [2025-02-05 16:45:35,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:45:35,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:35,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1138936359, now seen corresponding path program 1 times [2025-02-05 16:45:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591650813] [2025-02-05 16:45:35,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:35,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:45:35,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:45:35,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:36,291 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:45:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591650813] [2025-02-05 16:45:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591650813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683820111] [2025-02-05 16:45:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:36,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:36,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:36,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:36,293 INFO L87 Difference]: Start difference. First operand 1734 states and 2377 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:37,669 INFO L93 Difference]: Finished difference Result 2804 states and 3839 transitions. [2025-02-05 16:45:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 16:45:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:37,675 INFO L225 Difference]: With dead ends: 2804 [2025-02-05 16:45:37,675 INFO L226 Difference]: Without dead ends: 2385 [2025-02-05 16:45:37,676 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:45:37,676 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 6583 mSDsluCounter, 3199 mSDsCounter, 0 mSdLazyCounter, 3019 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6583 SdHoareTripleChecker+Valid, 4130 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:37,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6583 Valid, 4130 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3019 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:45:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-02-05 16:45:37,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1734. [2025-02-05 16:45:37,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3935483870967742) internal successors, (2376), 1733 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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:45:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2376 transitions. [2025-02-05 16:45:37,699 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2376 transitions. Word has length 112 [2025-02-05 16:45:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:37,699 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2376 transitions. [2025-02-05 16:45:37,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2376 transitions. [2025-02-05 16:45:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:45:37,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:37,701 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] [2025-02-05 16:45:37,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:45:37,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:37,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1730167735, now seen corresponding path program 1 times [2025-02-05 16:45:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:37,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321020672] [2025-02-05 16:45:37,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:37,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:37,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:45:37,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:45:37,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:37,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:38,090 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:45:38,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:38,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321020672] [2025-02-05 16:45:38,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321020672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:38,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136755755] [2025-02-05 16:45:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:38,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:38,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:38,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:38,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:38,092 INFO L87 Difference]: Start difference. First operand 1734 states and 2376 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:39,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:39,458 INFO L93 Difference]: Finished difference Result 2848 states and 3906 transitions. [2025-02-05 16:45:39,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:39,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 16:45:39,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:39,465 INFO L225 Difference]: With dead ends: 2848 [2025-02-05 16:45:39,465 INFO L226 Difference]: Without dead ends: 2649 [2025-02-05 16:45:39,465 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:45:39,466 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 6523 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6523 SdHoareTripleChecker+Valid, 4024 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:39,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6523 Valid, 4024 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2994 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:45:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-05 16:45:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1734. [2025-02-05 16:45:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3929618768328447) internal successors, (2375), 1733 states have internal predecessors, (2375), 0 states have call successors, (0), 0 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:45:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2375 transitions. [2025-02-05 16:45:39,489 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2375 transitions. Word has length 112 [2025-02-05 16:45:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2375 transitions. [2025-02-05 16:45:39,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2375 transitions. [2025-02-05 16:45:39,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 16:45:39,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:39,491 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] [2025-02-05 16:45:39,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:45:39,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:39,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash 478399625, now seen corresponding path program 1 times [2025-02-05 16:45:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682145023] [2025-02-05 16:45:39,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:39,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 16:45:39,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 16:45:39,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:39,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:39,795 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:45:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:39,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682145023] [2025-02-05 16:45:39,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682145023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:39,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:45:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830313376] [2025-02-05 16:45:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:39,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:45:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:39,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:45:39,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:45:39,797 INFO L87 Difference]: Start difference. First operand 1734 states and 2375 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:40,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:40,859 INFO L93 Difference]: Finished difference Result 3007 states and 3985 transitions. [2025-02-05 16:45:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:45:40,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-02-05 16:45:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:40,865 INFO L225 Difference]: With dead ends: 3007 [2025-02-05 16:45:40,865 INFO L226 Difference]: Without dead ends: 2276 [2025-02-05 16:45:40,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:45:40,866 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 7195 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 2813 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7195 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:40,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7195 Valid, 2633 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2813 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-02-05 16:45:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1734. [2025-02-05 16:45:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.392375366568915) internal successors, (2374), 1733 states have internal predecessors, (2374), 0 states have call successors, (0), 0 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:45:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2374 transitions. [2025-02-05 16:45:40,907 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2374 transitions. Word has length 112 [2025-02-05 16:45:40,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:40,907 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2374 transitions. [2025-02-05 16:45:40,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:45:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2374 transitions. [2025-02-05 16:45:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 16:45:40,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:40,909 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] [2025-02-05 16:45:40,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:45:40,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:40,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2018223992, now seen corresponding path program 1 times [2025-02-05 16:45:40,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:40,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872966518] [2025-02-05 16:45:40,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:40,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:45:41,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:45:41,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:41,318 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:45:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:41,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872966518] [2025-02-05 16:45:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872966518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:41,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:41,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554290739] [2025-02-05 16:45:41,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:41,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:41,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:41,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:41,320 INFO L87 Difference]: Start difference. First operand 1734 states and 2374 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:42,446 INFO L93 Difference]: Finished difference Result 2901 states and 3985 transitions. [2025-02-05 16:45:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:42,447 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-05 16:45:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:42,453 INFO L225 Difference]: With dead ends: 2901 [2025-02-05 16:45:42,453 INFO L226 Difference]: Without dead ends: 2673 [2025-02-05 16:45:42,454 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:45:42,454 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 4130 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 3000 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4130 SdHoareTripleChecker+Valid, 4091 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:42,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4130 Valid, 4091 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3000 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-02-05 16:45:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 1734. [2025-02-05 16:45:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3917888563049854) internal successors, (2373), 1733 states have internal predecessors, (2373), 0 states have call successors, (0), 0 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:45:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2373 transitions. [2025-02-05 16:45:42,503 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2373 transitions. Word has length 113 [2025-02-05 16:45:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:42,503 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2373 transitions. [2025-02-05 16:45:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2373 transitions. [2025-02-05 16:45:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 16:45:42,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:42,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:45:42,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:42,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2036256296, now seen corresponding path program 1 times [2025-02-05 16:45:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665225082] [2025-02-05 16:45:42,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:42,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:45:42,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:45:42,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:42,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:42,821 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:45:42,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:42,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665225082] [2025-02-05 16:45:42,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665225082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:42,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:42,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861467671] [2025-02-05 16:45:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:42,823 INFO L87 Difference]: Start difference. First operand 1734 states and 2373 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:43,929 INFO L93 Difference]: Finished difference Result 2686 states and 3627 transitions. [2025-02-05 16:45:43,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-05 16:45:43,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:43,935 INFO L225 Difference]: With dead ends: 2686 [2025-02-05 16:45:43,935 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 16:45:43,936 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:45:43,936 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 4482 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:43,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 3585 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 16:45:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 1734. [2025-02-05 16:45:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3912023460410556) internal successors, (2372), 1733 states have internal predecessors, (2372), 0 states have call successors, (0), 0 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:45:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2372 transitions. [2025-02-05 16:45:43,954 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2372 transitions. Word has length 113 [2025-02-05 16:45:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:43,955 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2372 transitions. [2025-02-05 16:45:43,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2372 transitions. [2025-02-05 16:45:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 16:45:43,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:43,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:45:43,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:45:43,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:43,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash -579338136, now seen corresponding path program 1 times [2025-02-05 16:45:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:43,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121075012] [2025-02-05 16:45:43,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 16:45:44,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 16:45:44,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:44,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:44,340 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:45:44,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121075012] [2025-02-05 16:45:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121075012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402246594] [2025-02-05 16:45:44,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:44,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:44,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:44,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:44,342 INFO L87 Difference]: Start difference. First operand 1734 states and 2372 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:45,485 INFO L93 Difference]: Finished difference Result 2843 states and 3897 transitions. [2025-02-05 16:45:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:45,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-02-05 16:45:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:45,491 INFO L225 Difference]: With dead ends: 2843 [2025-02-05 16:45:45,491 INFO L226 Difference]: Without dead ends: 2649 [2025-02-05 16:45:45,491 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:45:45,492 INFO L435 NwaCegarLoop]: 961 mSDtfsCounter, 6399 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6399 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 3121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:45,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6399 Valid, 4195 Invalid, 3121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:45,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-05 16:45:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1734. [2025-02-05 16:45:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.390615835777126) internal successors, (2371), 1733 states have internal predecessors, (2371), 0 states have call successors, (0), 0 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:45:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2371 transitions. [2025-02-05 16:45:45,522 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2371 transitions. Word has length 113 [2025-02-05 16:45:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:45,522 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2371 transitions. [2025-02-05 16:45:45,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:45:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2371 transitions. [2025-02-05 16:45:45,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:45,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:45,524 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:45:45,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:45:45,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:45,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:45,525 INFO L85 PathProgramCache]: Analyzing trace with hash 151491349, now seen corresponding path program 1 times [2025-02-05 16:45:45,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:45,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465429416] [2025-02-05 16:45:45,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:45,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:45,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:45,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:45,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:45,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:45,948 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:45:45,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465429416] [2025-02-05 16:45:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465429416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:45,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715650440] [2025-02-05 16:45:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:45,950 INFO L87 Difference]: Start difference. First operand 1734 states and 2371 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:47,531 INFO L93 Difference]: Finished difference Result 3027 states and 4139 transitions. [2025-02-05 16:45:47,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:45:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:47,540 INFO L225 Difference]: With dead ends: 3027 [2025-02-05 16:45:47,540 INFO L226 Difference]: Without dead ends: 2713 [2025-02-05 16:45:47,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:45:47,541 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 6563 mSDsluCounter, 5438 mSDsCounter, 0 mSdLazyCounter, 4748 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6563 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 4759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:47,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6563 Valid, 6361 Invalid, 4759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4748 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:45:47,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2025-02-05 16:45:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 1756. [2025-02-05 16:45:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1727 states have (on average 1.389114070642733) internal successors, (2399), 1755 states have internal predecessors, (2399), 0 states have call successors, (0), 0 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:45:47,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2399 transitions. [2025-02-05 16:45:47,564 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2399 transitions. Word has length 114 [2025-02-05 16:45:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:47,564 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2399 transitions. [2025-02-05 16:45:47,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2399 transitions. [2025-02-05 16:45:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:47,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:47,566 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:45:47,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:45:47,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:47,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash 796135061, now seen corresponding path program 1 times [2025-02-05 16:45:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324238706] [2025-02-05 16:45:47,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:47,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:47,887 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:45:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324238706] [2025-02-05 16:45:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324238706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723201446] [2025-02-05 16:45:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:47,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:47,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:47,891 INFO L87 Difference]: Start difference. First operand 1756 states and 2399 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:48,981 INFO L93 Difference]: Finished difference Result 2538 states and 3486 transitions. [2025-02-05 16:45:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:48,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:48,985 INFO L225 Difference]: With dead ends: 2538 [2025-02-05 16:45:48,985 INFO L226 Difference]: Without dead ends: 1824 [2025-02-05 16:45:48,986 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:45:48,986 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 2625 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 4127 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:48,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 4127 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:45:48,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2025-02-05 16:45:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1734. [2025-02-05 16:45:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3894428152492668) internal successors, (2369), 1733 states have internal predecessors, (2369), 0 states have call successors, (0), 0 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:45:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2369 transitions. [2025-02-05 16:45:49,001 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2369 transitions. Word has length 114 [2025-02-05 16:45:49,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:49,002 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2369 transitions. [2025-02-05 16:45:49,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2369 transitions. [2025-02-05 16:45:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:49,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:49,004 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:45:49,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:45:49,004 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:49,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1966888533, now seen corresponding path program 1 times [2025-02-05 16:45:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306816032] [2025-02-05 16:45:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:49,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:49,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:49,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:49,402 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:45:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306816032] [2025-02-05 16:45:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306816032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:49,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:49,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:49,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4957421] [2025-02-05 16:45:49,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:49,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:49,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:49,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:49,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:49,404 INFO L87 Difference]: Start difference. First operand 1734 states and 2369 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:50,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:50,754 INFO L93 Difference]: Finished difference Result 2792 states and 3803 transitions. [2025-02-05 16:45:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:45:50,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:50,758 INFO L225 Difference]: With dead ends: 2792 [2025-02-05 16:45:50,758 INFO L226 Difference]: Without dead ends: 2601 [2025-02-05 16:45:50,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:45:50,760 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 6378 mSDsluCounter, 3094 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6378 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:50,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6378 Valid, 4035 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:45:50,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2025-02-05 16:45:50,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1734. [2025-02-05 16:45:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3882697947214075) internal successors, (2367), 1733 states have internal predecessors, (2367), 0 states have call successors, (0), 0 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:45:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2367 transitions. [2025-02-05 16:45:50,777 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2367 transitions. Word has length 114 [2025-02-05 16:45:50,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:50,777 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2367 transitions. [2025-02-05 16:45:50,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:50,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2367 transitions. [2025-02-05 16:45:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:50,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:50,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:45:50,779 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 755119509, now seen corresponding path program 1 times [2025-02-05 16:45:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131682465] [2025-02-05 16:45:50,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:50,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:50,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:51,116 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:45:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131682465] [2025-02-05 16:45:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131682465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704617512] [2025-02-05 16:45:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:51,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:51,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:51,118 INFO L87 Difference]: Start difference. First operand 1734 states and 2367 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:52,490 INFO L93 Difference]: Finished difference Result 3103 states and 4265 transitions. [2025-02-05 16:45:52,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:52,490 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:52,494 INFO L225 Difference]: With dead ends: 3103 [2025-02-05 16:45:52,494 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 16:45:52,495 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:45:52,496 INFO L435 NwaCegarLoop]: 1419 mSDtfsCounter, 6465 mSDsluCounter, 4667 mSDsCounter, 0 mSdLazyCounter, 4323 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6465 SdHoareTripleChecker+Valid, 6086 SdHoareTripleChecker+Invalid, 4329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:52,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6465 Valid, 6086 Invalid, 4329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4323 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:45:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 16:45:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 1734. [2025-02-05 16:45:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3870967741935485) internal successors, (2365), 1733 states have internal predecessors, (2365), 0 states have call successors, (0), 0 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:45:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2365 transitions. [2025-02-05 16:45:52,513 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2365 transitions. Word has length 114 [2025-02-05 16:45:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2365 transitions. [2025-02-05 16:45:52,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2365 transitions. [2025-02-05 16:45:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:52,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:52,515 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:45:52,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:45:52,516 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:52,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2039919837, now seen corresponding path program 1 times [2025-02-05 16:45:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363952725] [2025-02-05 16:45:52,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:52,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:52,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:52,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:52,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:53,108 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:45:53,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363952725] [2025-02-05 16:45:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363952725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:53,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:45:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823801996] [2025-02-05 16:45:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:45:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:45:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:45:53,111 INFO L87 Difference]: Start difference. First operand 1734 states and 2365 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:55,134 INFO L93 Difference]: Finished difference Result 3752 states and 5222 transitions. [2025-02-05 16:45:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:45:55,134 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:55,140 INFO L225 Difference]: With dead ends: 3752 [2025-02-05 16:45:55,140 INFO L226 Difference]: Without dead ends: 3448 [2025-02-05 16:45:55,142 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:45:55,142 INFO L435 NwaCegarLoop]: 1373 mSDtfsCounter, 11411 mSDsluCounter, 5048 mSDsCounter, 0 mSdLazyCounter, 4678 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11411 SdHoareTripleChecker+Valid, 6421 SdHoareTripleChecker+Invalid, 4987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 4678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:55,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11411 Valid, 6421 Invalid, 4987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 4678 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:45:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2025-02-05 16:45:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 1739. [2025-02-05 16:45:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3859649122807018) internal successors, (2370), 1738 states have internal predecessors, (2370), 0 states have call successors, (0), 0 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:45:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2370 transitions. [2025-02-05 16:45:55,163 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2370 transitions. Word has length 114 [2025-02-05 16:45:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:55,163 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2370 transitions. [2025-02-05 16:45:55,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 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:45:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2370 transitions. [2025-02-05 16:45:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:55,165 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:45:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:45:55,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -794408571, now seen corresponding path program 1 times [2025-02-05 16:45:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67864807] [2025-02-05 16:45:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:55,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:55,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:55,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:55,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:55,500 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:45:55,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:55,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67864807] [2025-02-05 16:45:55,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67864807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:55,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805597376] [2025-02-05 16:45:55,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:55,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:55,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:55,501 INFO L87 Difference]: Start difference. First operand 1739 states and 2370 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:56,819 INFO L93 Difference]: Finished difference Result 2905 states and 3980 transitions. [2025-02-05 16:45:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:56,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:56,824 INFO L225 Difference]: With dead ends: 2905 [2025-02-05 16:45:56,824 INFO L226 Difference]: Without dead ends: 2678 [2025-02-05 16:45:56,824 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:45:56,824 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 5524 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5524 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 3968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:56,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5524 Valid, 5500 Invalid, 3968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:45:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-02-05 16:45:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 1739. [2025-02-05 16:45:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3853801169590643) internal successors, (2369), 1738 states have internal predecessors, (2369), 0 states have call successors, (0), 0 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:45:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2369 transitions. [2025-02-05 16:45:56,839 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2369 transitions. Word has length 114 [2025-02-05 16:45:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2369 transitions. [2025-02-05 16:45:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2369 transitions. [2025-02-05 16:45:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:56,841 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:56,841 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:45:56,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:45:56,841 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:56,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1496472481, now seen corresponding path program 1 times [2025-02-05 16:45:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:56,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333806154] [2025-02-05 16:45:56,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:56,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:56,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:56,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:56,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:56,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:57,160 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:45:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333806154] [2025-02-05 16:45:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333806154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081074304] [2025-02-05 16:45:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:57,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:57,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:57,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:57,163 INFO L87 Difference]: Start difference. First operand 1739 states and 2369 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:45:58,602 INFO L93 Difference]: Finished difference Result 2987 states and 4103 transitions. [2025-02-05 16:45:58,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:45:58,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:45:58,606 INFO L225 Difference]: With dead ends: 2987 [2025-02-05 16:45:58,606 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 16:45:58,607 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:45:58,607 INFO L435 NwaCegarLoop]: 1265 mSDtfsCounter, 6717 mSDsluCounter, 5242 mSDsCounter, 0 mSdLazyCounter, 4521 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6717 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 4528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:45:58,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6717 Valid, 6507 Invalid, 4528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4521 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:45:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 16:45:58,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 1739. [2025-02-05 16:45:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.384795321637427) internal successors, (2368), 1738 states have internal predecessors, (2368), 0 states have call successors, (0), 0 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:45:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2368 transitions. [2025-02-05 16:45:58,625 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2368 transitions. Word has length 114 [2025-02-05 16:45:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:45:58,626 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2368 transitions. [2025-02-05 16:45:58,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:45:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2368 transitions. [2025-02-05 16:45:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:45:58,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:45:58,628 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:45:58,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:45:58,629 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:45:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:45:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1564635489, now seen corresponding path program 1 times [2025-02-05 16:45:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:45:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653943347] [2025-02-05 16:45:58,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:45:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:45:58,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:45:58,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:45:58,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:45:58,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:45:58,922 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:45:58,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:45:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653943347] [2025-02-05 16:45:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653943347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:45:58,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:45:58,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:45:58,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958314370] [2025-02-05 16:45:58,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:45:58,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:45:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:45:58,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:45:58,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:45:58,926 INFO L87 Difference]: Start difference. First operand 1739 states and 2368 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:00,191 INFO L93 Difference]: Finished difference Result 2898 states and 3970 transitions. [2025-02-05 16:46:00,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:00,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:00,195 INFO L225 Difference]: With dead ends: 2898 [2025-02-05 16:46:00,195 INFO L226 Difference]: Without dead ends: 2678 [2025-02-05 16:46:00,196 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:46:00,196 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 3777 mSDsluCounter, 3724 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3777 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:00,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3777 Valid, 4836 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-02-05 16:46:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 1739. [2025-02-05 16:46:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3842105263157896) internal successors, (2367), 1738 states have internal predecessors, (2367), 0 states have call successors, (0), 0 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:46:00,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2367 transitions. [2025-02-05 16:46:00,215 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2367 transitions. Word has length 114 [2025-02-05 16:46:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:00,215 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2367 transitions. [2025-02-05 16:46:00,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:00,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2367 transitions. [2025-02-05 16:46:00,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 16:46:00,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:00,217 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:46:00,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:46:00,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1256518303, now seen corresponding path program 1 times [2025-02-05 16:46:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:00,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773057335] [2025-02-05 16:46:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:00,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 16:46:00,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 16:46:00,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:00,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:00,515 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:46:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:00,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773057335] [2025-02-05 16:46:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773057335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717595503] [2025-02-05 16:46:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:00,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:00,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:00,517 INFO L87 Difference]: Start difference. First operand 1739 states and 2367 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:01,862 INFO L93 Difference]: Finished difference Result 2845 states and 3886 transitions. [2025-02-05 16:46:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:01,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:01,868 INFO L225 Difference]: With dead ends: 2845 [2025-02-05 16:46:01,868 INFO L226 Difference]: Without dead ends: 2654 [2025-02-05 16:46:01,868 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:46:01,870 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 5496 mSDsluCounter, 4472 mSDsCounter, 0 mSdLazyCounter, 4002 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5496 SdHoareTripleChecker+Valid, 5519 SdHoareTripleChecker+Invalid, 4008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:01,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5496 Valid, 5519 Invalid, 4008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4002 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:46:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-05 16:46:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1739. [2025-02-05 16:46:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.383625730994152) internal successors, (2366), 1738 states have internal predecessors, (2366), 0 states have call successors, (0), 0 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:46:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2366 transitions. [2025-02-05 16:46:01,886 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2366 transitions. Word has length 114 [2025-02-05 16:46:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:01,886 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2366 transitions. [2025-02-05 16:46:01,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 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:46:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2366 transitions. [2025-02-05 16:46:01,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:01,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:01,888 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] [2025-02-05 16:46:01,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:46:01,888 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:01,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1945319388, now seen corresponding path program 1 times [2025-02-05 16:46:01,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:01,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564659802] [2025-02-05 16:46:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:01,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:01,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:01,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:01,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:01,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:02,175 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:46:02,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564659802] [2025-02-05 16:46:02,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564659802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:02,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:02,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:02,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054431290] [2025-02-05 16:46:02,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:02,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:02,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:02,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:02,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:02,176 INFO L87 Difference]: Start difference. First operand 1739 states and 2366 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:03,423 INFO L93 Difference]: Finished difference Result 2875 states and 3921 transitions. [2025-02-05 16:46:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:03,425 INFO L225 Difference]: With dead ends: 2875 [2025-02-05 16:46:03,425 INFO L226 Difference]: Without dead ends: 2654 [2025-02-05 16:46:03,426 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:46:03,426 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 6064 mSDsluCounter, 3487 mSDsCounter, 0 mSdLazyCounter, 3335 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6064 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:03,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6064 Valid, 4533 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3335 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-05 16:46:03,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1739. [2025-02-05 16:46:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3824561403508773) internal successors, (2364), 1738 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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:46:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2364 transitions. [2025-02-05 16:46:03,443 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2364 transitions. Word has length 115 [2025-02-05 16:46:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:03,443 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2364 transitions. [2025-02-05 16:46:03,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2364 transitions. [2025-02-05 16:46:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:03,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:03,446 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] [2025-02-05 16:46:03,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:46:03,446 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1293279612, now seen corresponding path program 1 times [2025-02-05 16:46:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972995275] [2025-02-05 16:46:03,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:03,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:03,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:03,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:03,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:03,723 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:46:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972995275] [2025-02-05 16:46:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972995275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696096769] [2025-02-05 16:46:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:03,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:03,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:03,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:03,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:03,724 INFO L87 Difference]: Start difference. First operand 1739 states and 2364 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:05,040 INFO L93 Difference]: Finished difference Result 2957 states and 4042 transitions. [2025-02-05 16:46:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:05,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:05,043 INFO L225 Difference]: With dead ends: 2957 [2025-02-05 16:46:05,043 INFO L226 Difference]: Without dead ends: 2678 [2025-02-05 16:46:05,044 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:46:05,044 INFO L435 NwaCegarLoop]: 1113 mSDtfsCounter, 5352 mSDsluCounter, 4730 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5352 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 4220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:05,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5352 Valid, 5843 Invalid, 4220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:46:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2678 states. [2025-02-05 16:46:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2678 to 1739. [2025-02-05 16:46:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3812865497076023) internal successors, (2362), 1738 states have internal predecessors, (2362), 0 states have call successors, (0), 0 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:46:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2362 transitions. [2025-02-05 16:46:05,056 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2362 transitions. Word has length 115 [2025-02-05 16:46:05,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:05,056 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2362 transitions. [2025-02-05 16:46:05,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2362 transitions. [2025-02-05 16:46:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:05,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:05,058 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] [2025-02-05 16:46:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:46:05,058 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -496127524, now seen corresponding path program 1 times [2025-02-05 16:46:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767136502] [2025-02-05 16:46:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:05,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:05,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:05,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:05,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:05,333 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:46:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:05,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767136502] [2025-02-05 16:46:05,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767136502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:05,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957433073] [2025-02-05 16:46:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:05,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:05,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:05,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:05,334 INFO L87 Difference]: Start difference. First operand 1739 states and 2362 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:06,535 INFO L93 Difference]: Finished difference Result 2872 states and 3915 transitions. [2025-02-05 16:46:06,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:06,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:06,537 INFO L225 Difference]: With dead ends: 2872 [2025-02-05 16:46:06,537 INFO L226 Difference]: Without dead ends: 2654 [2025-02-05 16:46:06,538 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:46:06,538 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 7997 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7997 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 3463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:06,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7997 Valid, 4707 Invalid, 3463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-05 16:46:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1739. [2025-02-05 16:46:06,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3801169590643274) internal successors, (2360), 1738 states have internal predecessors, (2360), 0 states have call successors, (0), 0 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:46:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2360 transitions. [2025-02-05 16:46:06,552 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2360 transitions. Word has length 115 [2025-02-05 16:46:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:06,552 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2360 transitions. [2025-02-05 16:46:06,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2360 transitions. [2025-02-05 16:46:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:06,553 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:06,553 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] [2025-02-05 16:46:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:46:06,554 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:06,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1276265812, now seen corresponding path program 1 times [2025-02-05 16:46:06,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:06,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171526768] [2025-02-05 16:46:06,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:06,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:06,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:06,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:06,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:06,819 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:46:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171526768] [2025-02-05 16:46:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171526768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:06,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621764135] [2025-02-05 16:46:06,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:06,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:06,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:06,820 INFO L87 Difference]: Start difference. First operand 1739 states and 2360 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:08,168 INFO L93 Difference]: Finished difference Result 2847 states and 3879 transitions. [2025-02-05 16:46:08,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:08,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:08,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:08,170 INFO L225 Difference]: With dead ends: 2847 [2025-02-05 16:46:08,170 INFO L226 Difference]: Without dead ends: 2654 [2025-02-05 16:46:08,171 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:46:08,171 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 7993 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 3452 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7993 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 3459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:08,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7993 Valid, 4707 Invalid, 3459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:46:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-05 16:46:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1739. [2025-02-05 16:46:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.37953216374269) internal successors, (2359), 1738 states have internal predecessors, (2359), 0 states have call successors, (0), 0 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:46:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2359 transitions. [2025-02-05 16:46:08,183 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2359 transitions. Word has length 115 [2025-02-05 16:46:08,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:08,184 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2359 transitions. [2025-02-05 16:46:08,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2359 transitions. [2025-02-05 16:46:08,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:08,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:08,185 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] [2025-02-05 16:46:08,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:46:08,185 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:08,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:08,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1449909871, now seen corresponding path program 1 times [2025-02-05 16:46:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:08,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033047378] [2025-02-05 16:46:08,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:08,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:08,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:08,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:08,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:08,445 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:46:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033047378] [2025-02-05 16:46:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033047378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926482884] [2025-02-05 16:46:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:08,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:08,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:08,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:08,447 INFO L87 Difference]: Start difference. First operand 1739 states and 2359 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:09,559 INFO L93 Difference]: Finished difference Result 2783 states and 3775 transitions. [2025-02-05 16:46:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:09,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:09,562 INFO L225 Difference]: With dead ends: 2783 [2025-02-05 16:46:09,562 INFO L226 Difference]: Without dead ends: 2606 [2025-02-05 16:46:09,562 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:46:09,563 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 7079 mSDsluCounter, 3320 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7079 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:09,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7079 Valid, 4336 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:46:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2025-02-05 16:46:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1739. [2025-02-05 16:46:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3789473684210527) internal successors, (2358), 1738 states have internal predecessors, (2358), 0 states have call successors, (0), 0 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:46:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2358 transitions. [2025-02-05 16:46:09,578 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2358 transitions. Word has length 115 [2025-02-05 16:46:09,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:09,578 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2358 transitions. [2025-02-05 16:46:09,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2358 transitions. [2025-02-05 16:46:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:09,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:09,580 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] [2025-02-05 16:46:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:46:09,581 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 509861096, now seen corresponding path program 1 times [2025-02-05 16:46:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442812463] [2025-02-05 16:46:09,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:09,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:09,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:09,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:09,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:09,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:46:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442812463] [2025-02-05 16:46:09,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442812463] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:09,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:09,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529620368] [2025-02-05 16:46:09,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:09,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:09,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:09,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:09,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:09,838 INFO L87 Difference]: Start difference. First operand 1739 states and 2358 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:11,049 INFO L93 Difference]: Finished difference Result 2862 states and 3891 transitions. [2025-02-05 16:46:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:11,052 INFO L225 Difference]: With dead ends: 2862 [2025-02-05 16:46:11,052 INFO L226 Difference]: Without dead ends: 2654 [2025-02-05 16:46:11,053 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:46:11,053 INFO L435 NwaCegarLoop]: 1089 mSDtfsCounter, 5843 mSDsluCounter, 3615 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5843 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 3452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:11,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5843 Valid, 4704 Invalid, 3452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2025-02-05 16:46:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 1739. [2025-02-05 16:46:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1710 states have (on average 1.3783625730994151) internal successors, (2357), 1738 states have internal predecessors, (2357), 0 states have call successors, (0), 0 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:46:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2357 transitions. [2025-02-05 16:46:11,065 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2357 transitions. Word has length 115 [2025-02-05 16:46:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:11,065 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2357 transitions. [2025-02-05 16:46:11,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:11,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2357 transitions. [2025-02-05 16:46:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 16:46:11,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:11,067 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] [2025-02-05 16:46:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:46:11,067 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash 145045578, now seen corresponding path program 1 times [2025-02-05 16:46:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506295211] [2025-02-05 16:46:11,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:11,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 16:46:11,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 16:46:11,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:11,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:11,298 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:46:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506295211] [2025-02-05 16:46:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506295211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769081492] [2025-02-05 16:46:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:11,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:11,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:11,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:11,299 INFO L87 Difference]: Start difference. First operand 1739 states and 2357 transitions. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:12,801 INFO L93 Difference]: Finished difference Result 3008 states and 4112 transitions. [2025-02-05 16:46:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-02-05 16:46:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:12,804 INFO L225 Difference]: With dead ends: 3008 [2025-02-05 16:46:12,804 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 16:46:12,805 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:46:12,805 INFO L435 NwaCegarLoop]: 1416 mSDtfsCounter, 5718 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5718 SdHoareTripleChecker+Valid, 6071 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:12,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5718 Valid, 6071 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:46:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 16:46:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 1734. [2025-02-05 16:46:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3788856304985337) internal successors, (2351), 1733 states have internal predecessors, (2351), 0 states have call successors, (0), 0 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:46:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2351 transitions. [2025-02-05 16:46:12,825 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2351 transitions. Word has length 115 [2025-02-05 16:46:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:12,825 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2351 transitions. [2025-02-05 16:46:12,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:46:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2351 transitions. [2025-02-05 16:46:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:12,827 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:12,827 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:46:12,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:46:12,827 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:12,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -808809918, now seen corresponding path program 1 times [2025-02-05 16:46:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:12,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25351740] [2025-02-05 16:46:12,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:12,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:12,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:12,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:12,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:12,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:13,066 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:46:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:13,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25351740] [2025-02-05 16:46:13,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25351740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:13,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:13,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638047847] [2025-02-05 16:46:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:13,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:13,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:13,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:13,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:13,067 INFO L87 Difference]: Start difference. First operand 1734 states and 2351 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:14,275 INFO L93 Difference]: Finished difference Result 2987 states and 4068 transitions. [2025-02-05 16:46:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:14,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:14,278 INFO L225 Difference]: With dead ends: 2987 [2025-02-05 16:46:14,278 INFO L226 Difference]: Without dead ends: 2673 [2025-02-05 16:46:14,279 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:46:14,279 INFO L435 NwaCegarLoop]: 1219 mSDtfsCounter, 4419 mSDsluCounter, 4041 mSDsCounter, 0 mSdLazyCounter, 3782 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 5260 SdHoareTripleChecker+Invalid, 3788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:14,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 5260 Invalid, 3788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3782 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:14,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-02-05 16:46:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 1734. [2025-02-05 16:46:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3777126099706745) internal successors, (2349), 1733 states have internal predecessors, (2349), 0 states have call successors, (0), 0 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:46:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2349 transitions. [2025-02-05 16:46:14,294 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2349 transitions. Word has length 116 [2025-02-05 16:46:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2349 transitions. [2025-02-05 16:46:14,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2349 transitions. [2025-02-05 16:46:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:14,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:14,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:46:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:46:14,296 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -164166206, now seen corresponding path program 1 times [2025-02-05 16:46:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426196530] [2025-02-05 16:46:14,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:14,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:14,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:14,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:14,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:46:14,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:14,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426196530] [2025-02-05 16:46:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426196530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198726950] [2025-02-05 16:46:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:14,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:14,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:14,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:14,554 INFO L87 Difference]: Start difference. First operand 1734 states and 2349 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:15,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:15,951 INFO L93 Difference]: Finished difference Result 3157 states and 4303 transitions. [2025-02-05 16:46:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:15,952 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:15,954 INFO L225 Difference]: With dead ends: 3157 [2025-02-05 16:46:15,954 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 16:46:15,955 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:46:15,956 INFO L435 NwaCegarLoop]: 1416 mSDtfsCounter, 3246 mSDsluCounter, 4655 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3246 SdHoareTripleChecker+Valid, 6071 SdHoareTripleChecker+Invalid, 4262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:15,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3246 Valid, 6071 Invalid, 4262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:46:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 16:46:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 1734. [2025-02-05 16:46:15,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3765395894428152) internal successors, (2347), 1733 states have internal predecessors, (2347), 0 states have call successors, (0), 0 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:46:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2347 transitions. [2025-02-05 16:46:15,972 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2347 transitions. Word has length 116 [2025-02-05 16:46:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:15,972 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2347 transitions. [2025-02-05 16:46:15,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2347 transitions. [2025-02-05 16:46:15,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:15,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:15,974 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:46:15,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:46:15,974 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:15,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash -786815102, now seen corresponding path program 1 times [2025-02-05 16:46:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251419662] [2025-02-05 16:46:15,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:16,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:16,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:16,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:16,195 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:46:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251419662] [2025-02-05 16:46:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251419662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055517397] [2025-02-05 16:46:16,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:16,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:16,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:16,196 INFO L87 Difference]: Start difference. First operand 1734 states and 2347 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:17,382 INFO L93 Difference]: Finished difference Result 2882 states and 3915 transitions. [2025-02-05 16:46:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:46:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:17,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:17,384 INFO L225 Difference]: With dead ends: 2882 [2025-02-05 16:46:17,384 INFO L226 Difference]: Without dead ends: 2649 [2025-02-05 16:46:17,385 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:46:17,385 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 5661 mSDsluCounter, 3821 mSDsCounter, 0 mSdLazyCounter, 3575 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5661 SdHoareTripleChecker+Valid, 4979 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:17,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5661 Valid, 4979 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3575 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:46:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-05 16:46:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1734. [2025-02-05 16:46:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3753665689149561) internal successors, (2345), 1733 states have internal predecessors, (2345), 0 states have call successors, (0), 0 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:46:17,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2345 transitions. [2025-02-05 16:46:17,404 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2345 transitions. Word has length 116 [2025-02-05 16:46:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:17,404 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2345 transitions. [2025-02-05 16:46:17,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2345 transitions. [2025-02-05 16:46:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:17,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:17,406 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:46:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:46:17,406 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1534043842, now seen corresponding path program 1 times [2025-02-05 16:46:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456118963] [2025-02-05 16:46:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:17,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:17,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:17,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:17,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:17,629 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:46:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456118963] [2025-02-05 16:46:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456118963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:17,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:17,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:17,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370704221] [2025-02-05 16:46:17,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:17,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:17,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:17,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:17,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:17,630 INFO L87 Difference]: Start difference. First operand 1734 states and 2345 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:18,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:18,901 INFO L93 Difference]: Finished difference Result 2972 states and 4045 transitions. [2025-02-05 16:46:18,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:18,903 INFO L225 Difference]: With dead ends: 2972 [2025-02-05 16:46:18,903 INFO L226 Difference]: Without dead ends: 2673 [2025-02-05 16:46:18,904 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:46:18,904 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 5054 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 4063 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5054 SdHoareTripleChecker+Valid, 5782 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:18,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5054 Valid, 5782 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4063 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 16:46:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-02-05 16:46:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 1734. [2025-02-05 16:46:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3741935483870968) internal successors, (2343), 1733 states have internal predecessors, (2343), 0 states have call successors, (0), 0 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:46:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2343 transitions. [2025-02-05 16:46:18,915 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2343 transitions. Word has length 116 [2025-02-05 16:46:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:18,915 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2343 transitions. [2025-02-05 16:46:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2343 transitions. [2025-02-05 16:46:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:18,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:18,916 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:46:18,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:46:18,917 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:18,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1662463806, now seen corresponding path program 1 times [2025-02-05 16:46:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402129562] [2025-02-05 16:46:18,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:18,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:18,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:18,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:18,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:19,168 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:46:19,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:19,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402129562] [2025-02-05 16:46:19,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402129562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:19,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:19,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:19,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050392637] [2025-02-05 16:46:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:19,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:19,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:19,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:19,169 INFO L87 Difference]: Start difference. First operand 1734 states and 2343 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:20,551 INFO L93 Difference]: Finished difference Result 2875 states and 3902 transitions. [2025-02-05 16:46:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:46:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:20,553 INFO L225 Difference]: With dead ends: 2875 [2025-02-05 16:46:20,553 INFO L226 Difference]: Without dead ends: 2649 [2025-02-05 16:46:20,554 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:46:20,554 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 7357 mSDsluCounter, 3994 mSDsCounter, 0 mSdLazyCounter, 3700 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7357 SdHoareTripleChecker+Valid, 5209 SdHoareTripleChecker+Invalid, 3707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:20,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7357 Valid, 5209 Invalid, 3707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3700 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:46:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2025-02-05 16:46:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1734. [2025-02-05 16:46:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1705 states have (on average 1.3730205278592376) internal successors, (2341), 1733 states have internal predecessors, (2341), 0 states have call successors, (0), 0 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:46:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2341 transitions. [2025-02-05 16:46:20,566 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2341 transitions. Word has length 116 [2025-02-05 16:46:20,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:20,566 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2341 transitions. [2025-02-05 16:46:20,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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:46:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2341 transitions. [2025-02-05 16:46:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:20,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:20,568 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:46:20,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:46:20,568 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:20,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash -427350094, now seen corresponding path program 1 times [2025-02-05 16:46:20,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:20,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378803927] [2025-02-05 16:46:20,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:20,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:20,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:20,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:20,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:20,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:20,962 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:46:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378803927] [2025-02-05 16:46:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378803927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:20,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:20,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:46:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47112822] [2025-02-05 16:46:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:20,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:46:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:20,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:46:20,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:46:20,963 INFO L87 Difference]: Start difference. First operand 1734 states and 2341 transitions. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 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:46:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:46:22,791 INFO L93 Difference]: Finished difference Result 3617 states and 4987 transitions. [2025-02-05 16:46:22,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:46:22,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 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:46:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:46:22,795 INFO L225 Difference]: With dead ends: 3617 [2025-02-05 16:46:22,795 INFO L226 Difference]: Without dead ends: 3337 [2025-02-05 16:46:22,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:46:22,796 INFO L435 NwaCegarLoop]: 1317 mSDtfsCounter, 12003 mSDsluCounter, 4748 mSDsCounter, 0 mSdLazyCounter, 4326 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12003 SdHoareTripleChecker+Valid, 6065 SdHoareTripleChecker+Invalid, 4638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 4326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:46:22,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12003 Valid, 6065 Invalid, 4638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 4326 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:46:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2025-02-05 16:46:22,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 1744. [2025-02-05 16:46:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1715 states have (on average 1.3708454810495627) internal successors, (2351), 1743 states have internal predecessors, (2351), 0 states have call successors, (0), 0 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:46:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2351 transitions. [2025-02-05 16:46:22,812 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2351 transitions. Word has length 116 [2025-02-05 16:46:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:46:22,812 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2351 transitions. [2025-02-05 16:46:22,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 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:46:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2351 transitions. [2025-02-05 16:46:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 16:46:22,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:46:22,813 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:46:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:46:22,814 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-02-05 16:46:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:46:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -121966350, now seen corresponding path program 1 times [2025-02-05 16:46:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:46:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705281881] [2025-02-05 16:46:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:46:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:46:22,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 16:46:22,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 16:46:22,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:46:22,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:46:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:46:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:46:23,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705281881] [2025-02-05 16:46:23,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705281881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:46:23,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:46:23,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:46:23,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376754734] [2025-02-05 16:46:23,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:46:23,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:46:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:46:23,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:46:23,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:46:23,061 INFO L87 Difference]: Start difference. First operand 1744 states and 2351 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 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)