./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea17b6f261bb6e2069b46537416ceb2b28c77bf12fbc31c6c070453fa873ea8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:16:01,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:16:01,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:16:01,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:16:01,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:16:01,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:16:01,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:16:01,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:16:01,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:16:01,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:16:01,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:16:01,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:16:01,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:16:01,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:01,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:16:01,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:16:01,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:16:01,665 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea17b6f261bb6e2069b46537416ceb2b28c77bf12fbc31c6c070453fa873ea8f [2025-03-03 15:16:01,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:16:01,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:16:01,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:16:01,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:16:01,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:16:01,879 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:03,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bca51186/dc27572aa24c4d8fb4bf625700416afa/FLAG21b559ae5 [2025-03-03 15:16:03,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:16:03,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:03,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bca51186/dc27572aa24c4d8fb4bf625700416afa/FLAG21b559ae5 [2025-03-03 15:16:03,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bca51186/dc27572aa24c4d8fb4bf625700416afa [2025-03-03 15:16:03,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:16:03,612 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:16:03,613 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:03,613 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:16:03,616 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:16:03,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:03" (1/1) ... [2025-03-03 15:16:03,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d2e2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:03, skipping insertion in model container [2025-03-03 15:16:03,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:16:03" (1/1) ... [2025-03-03 15:16:03,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:16:04,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80354,80367] [2025-03-03 15:16:04,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115904,115917] [2025-03-03 15:16:04,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133708,133721] [2025-03-03 15:16:04,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142627,142640] [2025-03-03 15:16:04,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[147060,147073] [2025-03-03 15:16:04,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151393,151406] [2025-03-03 15:16:04,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[186229,186242] [2025-03-03 15:16:04,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203860,203873] [2025-03-03 15:16:04,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212816,212829] [2025-03-03 15:16:04,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[217286,217299] [2025-03-03 15:16:04,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221656,221669] [2025-03-03 15:16:04,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240553,240566] [2025-03-03 15:16:04,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[249509,249522] [2025-03-03 15:16:04,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253979,253992] [2025-03-03 15:16:04,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[258349,258362] [2025-03-03 15:16:04,494 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[263314,263327] [2025-03-03 15:16:04,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267693,267706] [2025-03-03 15:16:04,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[272163,272176] [2025-03-03 15:16:04,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[276533,276546] [2025-03-03 15:16:04,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[281119,281132] [2025-03-03 15:16:04,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285656,285669] [2025-03-03 15:16:04,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[290122,290135] [2025-03-03 15:16:04,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:04,582 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:16:04,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[80354,80367] [2025-03-03 15:16:04,745 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[115904,115917] [2025-03-03 15:16:04,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[133708,133721] [2025-03-03 15:16:04,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[142627,142640] [2025-03-03 15:16:04,783 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[147060,147073] [2025-03-03 15:16:04,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[151393,151406] [2025-03-03 15:16:04,856 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[186229,186242] [2025-03-03 15:16:04,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[203860,203873] [2025-03-03 15:16:04,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[212816,212829] [2025-03-03 15:16:04,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[217286,217299] [2025-03-03 15:16:04,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[221656,221669] [2025-03-03 15:16:04,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[240553,240566] [2025-03-03 15:16:04,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[249509,249522] [2025-03-03 15:16:04,932 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[253979,253992] [2025-03-03 15:16:04,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[258349,258362] [2025-03-03 15:16:04,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[263314,263327] [2025-03-03 15:16:04,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[267693,267706] [2025-03-03 15:16:04,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[272163,272176] [2025-03-03 15:16:04,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[276533,276546] [2025-03-03 15:16:04,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[281119,281132] [2025-03-03 15:16:04,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[285656,285669] [2025-03-03 15:16:04,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c[290122,290135] [2025-03-03 15:16:04,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:16:05,019 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:16:05,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05 WrapperNode [2025-03-03 15:16:05,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:16:05,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:05,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:16:05,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:16:05,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,248 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13266 [2025-03-03 15:16:05,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:16:05,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:16:05,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:16:05,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:16:05,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:16:05,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:16:05,500 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:16:05,500 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:16:05,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:16:05,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (1/1) ... [2025-03-03 15:16:05,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:16:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:16:05,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:16:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:16:05,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:16:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:16:05,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:16:05,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:16:05,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:16:05,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18203: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~81#1; [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2090: havoc main_~node6__m6~7#1;havoc main_~node5__m5~6#1;havoc main_~node4__m4~5#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3413: havoc main_~node6__m6~13#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~10#1;havoc main_~node3__m3~9#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~9#1; [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14777: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~66#1;havoc main_~node6__m6~65#1;havoc main_~node5__m5~54#1;havoc main_~node4__m4~49#1;havoc main_~node3__m3~46#1;havoc main_~node2__m2~45#1;havoc main_~node1__m1~44#1;havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~65#1; [2025-03-03 15:16:10,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17420: havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~82#1;havoc main_~node6__m6~77#1;havoc main_~node5__m5~64#1;havoc main_~node4__m4~58#1;havoc main_~node3__m3~55#1;havoc main_~node2__m2~53#1;havoc main_~node1__m1~52#1;havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~81#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9757: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~35#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11080: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~40#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11881: havoc main_~node6__m6~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~37#1;havoc main_~node2__m2~36#1;havoc main_~node1__m1~35#1;havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20339: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~100#1;havoc main_~node6__m6~91#1;havoc main_~node5__m5~76#1;havoc main_~node4__m4~68#1;havoc main_~node3__m3~64#1;havoc main_~node2__m2~62#1;havoc main_~node1__m1~61#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~99#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21396: havoc main_~node5__m5~80#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8980: havoc main_~check__tmp~35#1;havoc main_~node6__m6~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~27#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~26#1;havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9774: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~42#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11097: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8458: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~27#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13486: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~59#1;havoc main_~node6__m6~59#1;havoc main_~node5__m5~49#1;havoc main_~node4__m4~44#1;havoc main_~node3__m3~42#1;havoc main_~node2__m2~41#1;havoc main_~node1__m1~40#1;havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~58#1; [2025-03-03 15:16:10,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6352: havoc main_~node6__m6~26#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~20#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~18#1;havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7678: havoc main_~check__tmp~28#1;havoc main_~node6__m6~32#1;havoc main_~node5__m5~27#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~22#1;havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~27#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10585: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1;havoc main_~node6__m6~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~31#1;havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14286: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~63#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16929: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~75#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8475: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~30#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5836: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~17#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: havoc main_~node6__m6~8#1;havoc main_~node5__m5~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19052: havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~92#1;havoc main_~node6__m6~85#1;havoc main_~node5__m5~71#1;havoc main_~node4__m4~64#1;havoc main_~node3__m3~60#1;havoc main_~node2__m2~58#1;havoc main_~node1__m1~57#1;havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~91#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3727: havoc main_~node6__m6~14#1;havoc main_~node5__m5~12#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20640: havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~102#1;havoc main_~node6__m6~92#1;havoc main_~node5__m5~77#1;havoc main_~node4__m4~69#1;havoc main_~node3__m3~65#1;havoc main_~node2__m2~63#1;havoc main_~node1__m1~62#1;havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~101#1; [2025-03-03 15:16:10,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5053: havoc main_~check__tmp~16#1;havoc main_~node6__m6~20#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~15#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~15#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1090: havoc main_~node6__m6~2#1;havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~36#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7173: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~25#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5853: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~18#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16424: havoc main_~check__tmp~76#1;havoc main_~node6__m6~73#1;havoc main_~node5__m5~61#1;havoc main_~node4__m4~55#1;havoc main_~node3__m3~52#1;havoc main_~node2__m2~50#1;havoc main_~node1__m1~49#1;havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~75#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20126: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~75#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12995: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~57#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12203: havoc main_~check__tmp~52#1;havoc main_~node6__m6~53#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~40#1;havoc main_~node3__m3~38#1;havoc main_~node2__m2~37#1;havoc main_~node1__m1~36#1;havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-03 15:16:10,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15110: havoc main_~check__tmp~68#1;havoc main_~node6__m6~67#1;havoc main_~node5__m5~56#1;havoc main_~node4__m4~50#1;havoc main_~node3__m3~47#1;havoc main_~node2__m2~46#1;havoc main_~node1__m1~45#1;havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~67#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17753: havoc main_~check__tmp~84#1;havoc main_~node6__m6~79#1;havoc main_~node5__m5~66#1;havoc main_~node4__m4~59#1;havoc main_~node3__m3~56#1;havoc main_~node2__m2~54#1;havoc main_~node1__m1~53#1;havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~83#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7190: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~30#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4548: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~15#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9305: havoc main_~check__tmp~37#1;havoc main_~node6__m6~40#1;havoc main_~node5__m5~33#1;havoc main_~node4__m4~30#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~27#1;havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~36#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5870: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10891: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1;havoc main_~node6__m6~47#1;havoc main_~node5__m5~39#1;havoc main_~node4__m4~35#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~32#1;havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3228: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~9#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20143: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~90#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21465: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~96#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18827: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~63#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16187: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~51#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13810: havoc main_~node6__m6~61#1;havoc main_~node5__m5~51#1;havoc main_~node4__m4~46#1;havoc main_~node3__m3~43#1;havoc main_~node2__m2~42#1;havoc main_~node1__m1~41#1;havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~60#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~5#1; [2025-03-03 15:16:10,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4565: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~18#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5887: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~24#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3245: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~10#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8003: havoc main_~check__tmp~30#1;havoc main_~node6__m6~34#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~25#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~23#1;havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~29#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19369: havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~94#1;havoc main_~node6__m6~86#1;havoc main_~node5__m5~72#1;havoc main_~node4__m4~65#1;havoc main_~node3__m3~61#1;havoc main_~node2__m2~59#1;havoc main_~node1__m1~58#1;havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~93#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6685: havoc main_~node6__m6~28#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~19#1;havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20956: havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~104#1;havoc main_~node6__m6~94#1;havoc main_~node5__m5~78#1;havoc main_~node4__m4~70#1;havoc main_~node3__m3~66#1;havoc main_~node2__m2~64#1;havoc main_~node1__m1~63#1;havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~103#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18844: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~70#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16204: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~54#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21493: havoc main_~node5____CPAchecker_TMP_0~16#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1939: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~6#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3262: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~12#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5378: havoc main_~check__tmp~18#1;havoc main_~node6__m6~22#1;havoc main_~node5__m5~18#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~17#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10400: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~45#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737: havoc main_~node6__m6~10#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4060: havoc main_~node6__m6~16#1;havoc main_~node5__m5~13#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15424: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~70#1;havoc main_~node6__m6~68#1;havoc main_~node5__m5~57#1;havoc main_~node4__m4~51#1;havoc main_~node3__m3~48#1;havoc main_~node2__m2~47#1;havoc main_~node1__m1~46#1;havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~69#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18067: havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~86#1;havoc main_~node6__m6~80#1;havoc main_~node5__m5~67#1;havoc main_~node4__m4~60#1;havoc main_~node3__m3~57#1;havoc main_~node2__m2~55#1;havoc main_~node1__m1~54#1;havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~85#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18861: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~84#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12519: havoc main_~node6__m6~55#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~41#1;havoc main_~node3__m3~39#1;havoc main_~node2__m2~38#1;havoc main_~node1__m1~37#1;havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~53#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16221: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~60#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11730: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~51#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9619: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~39#1;havoc main_~node6__m6~41#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~28#1;havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~38#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1429: havoc main_~node6__m6~4#1;havoc main_~node5__m5~3#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21521: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:16:10,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14916: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~55#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17559: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~65#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16238: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~72#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21266: havoc main_~node1__m1~65#1;havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~106#1;havoc main_~node6__m6~95#1;havoc main_~node5__m5~79#1;havoc main_~node4__m4~71#1;havoc main_~node3__m3~67#1;havoc main_~node2__m2~65#1;havoc main_~node1__m1~64#1;havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~105#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8317: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node6__m6~35#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~24#1;havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14138: havoc main_~check__tmp~62#1;havoc main_~node6__m6~62#1;havoc main_~node5__m5~52#1;havoc main_~node4__m4~47#1;havoc main_~node3__m3~44#1;havoc main_~node2__m2~43#1;havoc main_~node1__m1~42#1;havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~61#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16781: havoc main_~check__tmp~78#1;havoc main_~node6__m6~74#1;havoc main_~node5__m5~62#1;havoc main_~node4__m4~56#1;havoc main_~node3__m3~53#1;havoc main_~node2__m2~51#1;havoc main_~node1__m1~50#1;havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~77#1; [2025-03-03 15:16:10,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14933: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~66#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17576: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~78#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19690: havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~96#1;havoc main_~node6__m6~88#1;havoc main_~node5__m5~73#1;havoc main_~node4__m4~66#1;havoc main_~node3__m3~62#1;havoc main_~node2__m2~60#1;havoc main_~node1__m1~59#1;havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~95#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5692: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1;havoc main_~node6__m6~23#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9128: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~39#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21549: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11248: havoc main_~node6__m6~49#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~34#1;havoc main_~node1__m1~33#1;havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13628: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~45#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7022: havoc main_~check__tmp~25#1;havoc main_~node6__m6~29#1;havoc main_~node5__m5~24#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~20#1;havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18388: havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~88#1;havoc main_~node6__m6~82#1;havoc main_~node5__m5~68#1;havoc main_~node4__m4~61#1;havoc main_~node3__m3~58#1;havoc main_~node2__m2~56#1;havoc main_~node1__m1~55#1;havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~87#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15745: havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~72#1;havoc main_~node6__m6~70#1;havoc main_~node5__m5~58#1;havoc main_~node4__m4~52#1;havoc main_~node3__m3~49#1;havoc main_~node2__m2~48#1;havoc main_~node1__m1~47#1;havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~71#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20766: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~93#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740: havoc main_~node6__m6~5#1;havoc main_~node5__m5~4#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:16:10,235 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21300: havoc main_~node2__m2~66#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7826: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~33#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12847: havoc main_~check__tmp~55#1;havoc main_~node6__m6~56#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~42#1;havoc main_~node3__m3~40#1;havoc main_~node2__m2~39#1;havoc main_~node1__m1~38#1;havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~54#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3074: havoc main_~check__tmp~8#1;havoc main_~node6__m6~11#1;havoc main_~node5__m5~9#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13645: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~50#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc main_~check__tmp~13#1;havoc main_~node6__m6~17#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21577: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9951: havoc main_~check__tmp~41#1;havoc main_~node6__m6~43#1;havoc main_~node5__m5~36#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~29#1;havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~40#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19997: havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~98#1;havoc main_~node6__m6~89#1;havoc main_~node5__m5~74#1;havoc main_~node4__m4~67#1;havoc main_~node3__m3~63#1;havoc main_~node2__m2~61#1;havoc main_~node1__m1~60#1;havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~97#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5201: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~21#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8640: havoc main_~node6__m6~37#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~25#1;havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13662: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~60#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21332: havoc main_~node3__m3~68#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6534: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~27#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14463: havoc main_~check__tmp~64#1;havoc main_~node6__m6~64#1;havoc main_~node5__m5~53#1;havoc main_~node4__m4~48#1;havoc main_~node3__m3~45#1;havoc main_~node2__m2~44#1;havoc main_~node1__m1~43#1;havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~63#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17106: havoc main_~check__tmp~80#1;havoc main_~node6__m6~76#1;havoc main_~node5__m5~63#1;havoc main_~node4__m4~57#1;havoc main_~node3__m3~54#1;havoc main_~node2__m2~52#1;havoc main_~node1__m1~51#1;havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~79#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11029: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~33#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16052: havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~74#1;havoc main_~node6__m6~71#1;havoc main_~node5__m5~59#1;havoc main_~node4__m4~53#1;havoc main_~node3__m3~50#1;havoc main_~node2__m2~49#1;havoc main_~node1__m1~48#1;havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~73#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18695: havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~90#1;havoc main_~node6__m6~83#1;havoc main_~node5__m5~69#1;havoc main_~node4__m4~62#1;havoc main_~node3__m3~59#1;havoc main_~node2__m2~57#1;havoc main_~node1__m1~56#1;havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~89#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11560: havoc main_~node6__m6~50#1;havoc main_~node5__m5~42#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~36#1;havoc main_~node2__m2~35#1;havoc main_~node1__m1~34#1;havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12354: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~45#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21605: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7338: havoc main_~node6__m6~31#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~21#1;havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~26#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~9#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3909: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~15#1; [2025-03-03 15:16:10,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11046: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~34#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19505: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~87#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12371: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~54#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~3#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4713: havoc main_~node6__m6~19#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21364: havoc main_~node4__m4~72#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13172: havoc main_~check__tmp~57#1;havoc main_~node6__m6~58#1;havoc main_~node5__m5~48#1;havoc main_~node4__m4~43#1;havoc main_~node3__m3~41#1;havoc main_~node2__m2~40#1;havoc main_~node1__m1~39#1;havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~56#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10265: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1;havoc main_~node6__m6~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~30#1;havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6038: havoc main_~node6__m6~25#1;havoc main_~node5__m5~21#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~18#1;havoc main_~node2__m2~17#1;havoc main_~node1__m1~17#1;havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11063: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~36#1; [2025-03-03 15:16:10,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15560: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~69#1; [2025-03-03 15:16:10,678 INFO L? ?]: Removed 2736 outVars from TransFormulas that were not future-live. [2025-03-03 15:16:10,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:16:10,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:16:10,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:16:10,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:10 BoogieIcfgContainer [2025-03-03 15:16:10,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:16:10,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:16:10,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:16:10,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:16:10,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:16:03" (1/3) ... [2025-03-03 15:16:10,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e816683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:10, skipping insertion in model container [2025-03-03 15:16:10,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:16:05" (2/3) ... [2025-03-03 15:16:10,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e816683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:16:10, skipping insertion in model container [2025-03-03 15:16:10,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:16:10" (3/3) ... [2025-03-03 15:16:10,726 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c [2025-03-03 15:16:10,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:16:10,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+sep-reducer.c that has 1 procedures, 2541 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-03 15:16:10,860 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:16:10,868 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;@7c85ada5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:16:10,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-03 15:16:10,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:16:10,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:10,898 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:10,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 755284470, now seen corresponding path program 1 times [2025-03-03 15:16:10,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:10,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177724821] [2025-03-03 15:16:10,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:10,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:11,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:16:11,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:16:11,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:11,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177724821] [2025-03-03 15:16:11,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177724821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:11,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:11,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208622671] [2025-03-03 15:16:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:11,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:11,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:11,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:11,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:11,538 INFO L87 Difference]: Start difference. First operand has 2541 states, 2518 states have (on average 1.7589356632247817) internal successors, (4429), 2540 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:12,791 INFO L93 Difference]: Finished difference Result 2886 states and 4965 transitions. [2025-03-03 15:16:12,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:12,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:16:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:12,812 INFO L225 Difference]: With dead ends: 2886 [2025-03-03 15:16:12,813 INFO L226 Difference]: Without dead ends: 1634 [2025-03-03 15:16:12,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:12,822 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 8216 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8216 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:12,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8216 Valid, 1638 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:16:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-03 15:16:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-03 15:16:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1612 states have (on average 1.2890818858560793) internal successors, (2078), 1633 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2078 transitions. [2025-03-03 15:16:12,914 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2078 transitions. Word has length 87 [2025-03-03 15:16:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2078 transitions. [2025-03-03 15:16:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2078 transitions. [2025-03-03 15:16:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:16:12,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:12,921 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:12,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:16:12,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash 616392988, now seen corresponding path program 1 times [2025-03-03 15:16:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535062080] [2025-03-03 15:16:12,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:12,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:16:12,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:16:12,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:12,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:13,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:13,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535062080] [2025-03-03 15:16:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535062080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:13,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:13,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944683219] [2025-03-03 15:16:13,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:13,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:13,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:13,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:13,146 INFO L87 Difference]: Start difference. First operand 1634 states and 2078 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:14,299 INFO L93 Difference]: Finished difference Result 2849 states and 3671 transitions. [2025-03-03 15:16:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:16:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:14,308 INFO L225 Difference]: With dead ends: 2849 [2025-03-03 15:16:14,309 INFO L226 Difference]: Without dead ends: 2017 [2025-03-03 15:16:14,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:14,310 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 6947 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6947 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:14,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6947 Valid, 1335 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:16:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-03-03 15:16:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1886. [2025-03-03 15:16:14,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1864 states have (on average 1.340128755364807) internal successors, (2498), 1885 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2498 transitions. [2025-03-03 15:16:14,346 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2498 transitions. Word has length 87 [2025-03-03 15:16:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:14,347 INFO L471 AbstractCegarLoop]: Abstraction has 1886 states and 2498 transitions. [2025-03-03 15:16:14,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2498 transitions. [2025-03-03 15:16:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:16:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:14,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:14,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:16:14,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:14,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1830642302, now seen corresponding path program 1 times [2025-03-03 15:16:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:14,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620628621] [2025-03-03 15:16:14,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:14,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:16:14,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:16:14,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:14,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:14,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:14,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620628621] [2025-03-03 15:16:14,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620628621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:14,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:14,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083370270] [2025-03-03 15:16:14,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:14,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:14,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:14,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:14,502 INFO L87 Difference]: Start difference. First operand 1886 states and 2498 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:15,275 INFO L93 Difference]: Finished difference Result 2583 states and 3434 transitions. [2025-03-03 15:16:15,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:15,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-03 15:16:15,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:15,281 INFO L225 Difference]: With dead ends: 2583 [2025-03-03 15:16:15,281 INFO L226 Difference]: Without dead ends: 1822 [2025-03-03 15:16:15,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:15,283 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 4986 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4986 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:15,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4986 Valid, 816 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2025-03-03 15:16:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2025-03-03 15:16:15,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1800 states have (on average 1.3466666666666667) internal successors, (2424), 1821 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2424 transitions. [2025-03-03 15:16:15,310 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2424 transitions. Word has length 87 [2025-03-03 15:16:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:15,310 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2424 transitions. [2025-03-03 15:16:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2424 transitions. [2025-03-03 15:16:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 15:16:15,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:15,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:15,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:16:15,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:15,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:15,313 INFO L85 PathProgramCache]: Analyzing trace with hash 164884638, now seen corresponding path program 1 times [2025-03-03 15:16:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:15,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748687922] [2025-03-03 15:16:15,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:15,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 15:16:15,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 15:16:15,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:15,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:15,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748687922] [2025-03-03 15:16:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748687922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894692962] [2025-03-03 15:16:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:15,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:15,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:15,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:15,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:15,468 INFO L87 Difference]: Start difference. First operand 1822 states and 2424 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:15,984 INFO L93 Difference]: Finished difference Result 2432 states and 3244 transitions. [2025-03-03 15:16:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-03 15:16:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:15,988 INFO L225 Difference]: With dead ends: 2432 [2025-03-03 15:16:15,988 INFO L226 Difference]: Without dead ends: 1501 [2025-03-03 15:16:15,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:15,990 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 4138 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:15,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 746 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:15,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-03-03 15:16:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2025-03-03 15:16:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1479 states have (on average 1.3610547667342798) internal successors, (2013), 1500 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2013 transitions. [2025-03-03 15:16:16,010 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2013 transitions. Word has length 89 [2025-03-03 15:16:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:16,010 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2013 transitions. [2025-03-03 15:16:16,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2013 transitions. [2025-03-03 15:16:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:16:16,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:16,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:16,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:16:16,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:16,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:16,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1506905864, now seen corresponding path program 1 times [2025-03-03 15:16:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868798526] [2025-03-03 15:16:16,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:16,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:16:16,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:16:16,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:16,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868798526] [2025-03-03 15:16:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868798526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:16,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:16,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:16,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668760508] [2025-03-03 15:16:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:16,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:16,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:16,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:16,181 INFO L87 Difference]: Start difference. First operand 1501 states and 2013 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:16,505 INFO L93 Difference]: Finished difference Result 1788 states and 2370 transitions. [2025-03-03 15:16:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2025-03-03 15:16:16,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:16,508 INFO L225 Difference]: With dead ends: 1788 [2025-03-03 15:16:16,508 INFO L226 Difference]: Without dead ends: 1055 [2025-03-03 15:16:16,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:16,509 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2809 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2809 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:16,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2809 Valid, 556 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-03-03 15:16:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1055. [2025-03-03 15:16:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1033 states have (on average 1.3707647628267183) internal successors, (1416), 1054 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1416 transitions. [2025-03-03 15:16:16,521 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1416 transitions. Word has length 91 [2025-03-03 15:16:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:16,521 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1416 transitions. [2025-03-03 15:16:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1416 transitions. [2025-03-03 15:16:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:16:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:16,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:16,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:16:16,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:16,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1734660308, now seen corresponding path program 1 times [2025-03-03 15:16:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:16,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702714601] [2025-03-03 15:16:16,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:16:16,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:16:16,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:16,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702714601] [2025-03-03 15:16:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702714601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:16,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:16:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565245037] [2025-03-03 15:16:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:16:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:16,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:16:16,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:16:16,648 INFO L87 Difference]: Start difference. First operand 1055 states and 1416 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:16,941 INFO L93 Difference]: Finished difference Result 1581 states and 2133 transitions. [2025-03-03 15:16:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:16:16,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 15:16:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:16,943 INFO L225 Difference]: With dead ends: 1581 [2025-03-03 15:16:16,943 INFO L226 Difference]: Without dead ends: 994 [2025-03-03 15:16:16,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:16:16,944 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2681 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2681 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:16,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2681 Valid, 550 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:16:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-03 15:16:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-03-03 15:16:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3786008230452675) internal successors, (1340), 993 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1340 transitions. [2025-03-03 15:16:16,955 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1340 transitions. Word has length 93 [2025-03-03 15:16:16,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:16,955 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1340 transitions. [2025-03-03 15:16:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1340 transitions. [2025-03-03 15:16:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:16,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:16,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:16,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:16:16,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1907477939, now seen corresponding path program 1 times [2025-03-03 15:16:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598028523] [2025-03-03 15:16:16,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:17,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:17,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:17,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598028523] [2025-03-03 15:16:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598028523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:17,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:17,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:16:17,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887854032] [2025-03-03 15:16:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:17,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:16:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:17,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:16:17,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:16:17,405 INFO L87 Difference]: Start difference. First operand 994 states and 1340 transitions. Second operand has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:18,353 INFO L93 Difference]: Finished difference Result 1804 states and 2433 transitions. [2025-03-03 15:16:18,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:18,357 INFO L225 Difference]: With dead ends: 1804 [2025-03-03 15:16:18,357 INFO L226 Difference]: Without dead ends: 1373 [2025-03-03 15:16:18,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:18,358 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 3874 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3874 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:18,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3874 Valid, 2855 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-03-03 15:16:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 994. [2025-03-03 15:16:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.376543209876543) internal successors, (1338), 993 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1338 transitions. [2025-03-03 15:16:18,368 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1338 transitions. Word has length 95 [2025-03-03 15:16:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:18,368 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1338 transitions. [2025-03-03 15:16:18,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.636363636363637) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1338 transitions. [2025-03-03 15:16:18,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:18,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:18,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:18,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:16:18,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:18,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash -926750067, now seen corresponding path program 1 times [2025-03-03 15:16:18,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:18,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938815503] [2025-03-03 15:16:18,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:18,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:18,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:18,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:18,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:18,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938815503] [2025-03-03 15:16:18,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938815503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:16:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357735764] [2025-03-03 15:16:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:16:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:18,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:16:18,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:16:18,719 INFO L87 Difference]: Start difference. First operand 994 states and 1338 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:19,569 INFO L93 Difference]: Finished difference Result 1809 states and 2374 transitions. [2025-03-03 15:16:19,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:16:19,570 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:19,573 INFO L225 Difference]: With dead ends: 1809 [2025-03-03 15:16:19,573 INFO L226 Difference]: Without dead ends: 1357 [2025-03-03 15:16:19,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:16:19,574 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 3732 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3732 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:19,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3732 Valid, 2014 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:19,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-03 15:16:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 994. [2025-03-03 15:16:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.375514403292181) internal successors, (1337), 993 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1337 transitions. [2025-03-03 15:16:19,587 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1337 transitions. Word has length 95 [2025-03-03 15:16:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:19,587 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1337 transitions. [2025-03-03 15:16:19,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1337 transitions. [2025-03-03 15:16:19,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:19,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:19,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:19,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:16:19,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:19,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1504200469, now seen corresponding path program 1 times [2025-03-03 15:16:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:19,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831466277] [2025-03-03 15:16:19,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:19,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:19,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:19,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:19,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831466277] [2025-03-03 15:16:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831466277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:19,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:19,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:19,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31108043] [2025-03-03 15:16:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:19,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:19,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:19,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:19,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:19,935 INFO L87 Difference]: Start difference. First operand 994 states and 1337 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:21,198 INFO L93 Difference]: Finished difference Result 1722 states and 2321 transitions. [2025-03-03 15:16:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:16:21,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:21,202 INFO L225 Difference]: With dead ends: 1722 [2025-03-03 15:16:21,202 INFO L226 Difference]: Without dead ends: 1555 [2025-03-03 15:16:21,202 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-03-03 15:16:21,202 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 4260 mSDsluCounter, 3034 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4260 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:21,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4260 Valid, 3555 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:16:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-03-03 15:16:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1012. [2025-03-03 15:16:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 990 states have (on average 1.3747474747474748) internal successors, (1361), 1011 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1361 transitions. [2025-03-03 15:16:21,219 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1361 transitions. Word has length 95 [2025-03-03 15:16:21,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:21,220 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1361 transitions. [2025-03-03 15:16:21,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1361 transitions. [2025-03-03 15:16:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:21,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:21,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:21,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:16:21,222 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:21,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash -252592819, now seen corresponding path program 1 times [2025-03-03 15:16:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455677255] [2025-03-03 15:16:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:21,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:21,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:21,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:21,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:21,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455677255] [2025-03-03 15:16:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455677255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98988600] [2025-03-03 15:16:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:21,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:21,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:21,578 INFO L87 Difference]: Start difference. First operand 1012 states and 1361 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:22,751 INFO L93 Difference]: Finished difference Result 1810 states and 2458 transitions. [2025-03-03 15:16:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:22,751 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:22,755 INFO L225 Difference]: With dead ends: 1810 [2025-03-03 15:16:22,755 INFO L226 Difference]: Without dead ends: 1590 [2025-03-03 15:16:22,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:16:22,756 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 3393 mSDsluCounter, 3214 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3393 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:22,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3393 Valid, 3895 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:16:22,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-03 15:16:22,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1012. [2025-03-03 15:16:22,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 990 states have (on average 1.3737373737373737) internal successors, (1360), 1011 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1360 transitions. [2025-03-03 15:16:22,767 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1360 transitions. Word has length 95 [2025-03-03 15:16:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:22,767 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1360 transitions. [2025-03-03 15:16:22,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1360 transitions. [2025-03-03 15:16:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:22,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:22,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:22,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:16:22,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:22,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1438874317, now seen corresponding path program 1 times [2025-03-03 15:16:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:22,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270267318] [2025-03-03 15:16:22,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:22,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:22,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:22,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270267318] [2025-03-03 15:16:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270267318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:23,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279268651] [2025-03-03 15:16:23,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:23,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:23,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:23,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:23,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:23,051 INFO L87 Difference]: Start difference. First operand 1012 states and 1360 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:23,846 INFO L93 Difference]: Finished difference Result 1431 states and 1959 transitions. [2025-03-03 15:16:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:16:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:23,849 INFO L225 Difference]: With dead ends: 1431 [2025-03-03 15:16:23,849 INFO L226 Difference]: Without dead ends: 1149 [2025-03-03 15:16:23,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:16:23,850 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2211 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2211 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:23,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2211 Valid, 3096 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-03-03 15:16:23,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 994. [2025-03-03 15:16:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.374485596707819) internal successors, (1336), 993 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1336 transitions. [2025-03-03 15:16:23,859 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1336 transitions. Word has length 95 [2025-03-03 15:16:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:23,860 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1336 transitions. [2025-03-03 15:16:23,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1336 transitions. [2025-03-03 15:16:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 15:16:23,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:23,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:23,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:16:23,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1978500275, now seen corresponding path program 1 times [2025-03-03 15:16:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849623690] [2025-03-03 15:16:23,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:23,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 15:16:23,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 15:16:23,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:23,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:24,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:24,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849623690] [2025-03-03 15:16:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849623690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:24,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79473877] [2025-03-03 15:16:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:24,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:24,106 INFO L87 Difference]: Start difference. First operand 994 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:24,997 INFO L93 Difference]: Finished difference Result 1772 states and 2414 transitions. [2025-03-03 15:16:24,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:24,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-03-03 15:16:24,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:25,000 INFO L225 Difference]: With dead ends: 1772 [2025-03-03 15:16:25,000 INFO L226 Difference]: Without dead ends: 1566 [2025-03-03 15:16:25,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:25,001 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 4017 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 2255 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4017 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:25,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4017 Valid, 3309 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-03 15:16:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 994. [2025-03-03 15:16:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.373456790123457) internal successors, (1335), 993 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1335 transitions. [2025-03-03 15:16:25,011 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1335 transitions. Word has length 95 [2025-03-03 15:16:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:25,011 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1335 transitions. [2025-03-03 15:16:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1335 transitions. [2025-03-03 15:16:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:16:25,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:25,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:25,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:16:25,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:25,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1003472147, now seen corresponding path program 1 times [2025-03-03 15:16:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:25,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747081601] [2025-03-03 15:16:25,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:25,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:16:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:16:25,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:25,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747081601] [2025-03-03 15:16:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930566303] [2025-03-03 15:16:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:25,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:25,258 INFO L87 Difference]: Start difference. First operand 994 states and 1335 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:26,058 INFO L93 Difference]: Finished difference Result 1708 states and 2319 transitions. [2025-03-03 15:16:26,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:26,058 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 15:16:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:26,062 INFO L225 Difference]: With dead ends: 1708 [2025-03-03 15:16:26,062 INFO L226 Difference]: Without dead ends: 1536 [2025-03-03 15:16:26,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:26,062 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 4899 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4899 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:26,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4899 Valid, 2498 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-03 15:16:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 994. [2025-03-03 15:16:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3724279835390947) internal successors, (1334), 993 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1334 transitions. [2025-03-03 15:16:26,073 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1334 transitions. Word has length 96 [2025-03-03 15:16:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:26,073 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1334 transitions. [2025-03-03 15:16:26,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1334 transitions. [2025-03-03 15:16:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:26,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:26,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:16:26,075 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1801007994, now seen corresponding path program 1 times [2025-03-03 15:16:26,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:26,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809580503] [2025-03-03 15:16:26,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:26,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:26,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:26,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:26,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:26,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:26,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:26,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809580503] [2025-03-03 15:16:26,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809580503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:26,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248505562] [2025-03-03 15:16:26,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:26,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:26,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:26,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:26,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:26,324 INFO L87 Difference]: Start difference. First operand 994 states and 1334 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:27,164 INFO L93 Difference]: Finished difference Result 1824 states and 2479 transitions. [2025-03-03 15:16:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:27,168 INFO L225 Difference]: With dead ends: 1824 [2025-03-03 15:16:27,168 INFO L226 Difference]: Without dead ends: 1566 [2025-03-03 15:16:27,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:27,169 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 3727 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3727 SdHoareTripleChecker+Valid, 3495 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:27,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3727 Valid, 3495 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-03 15:16:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 994. [2025-03-03 15:16:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3703703703703705) internal successors, (1332), 993 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1332 transitions. [2025-03-03 15:16:27,181 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1332 transitions. Word has length 97 [2025-03-03 15:16:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:27,181 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1332 transitions. [2025-03-03 15:16:27,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1332 transitions. [2025-03-03 15:16:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:27,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:27,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:27,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:16:27,182 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:27,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:27,183 INFO L85 PathProgramCache]: Analyzing trace with hash 870783034, now seen corresponding path program 1 times [2025-03-03 15:16:27,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:27,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281970869] [2025-03-03 15:16:27,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:27,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:27,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:27,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:27,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:27,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281970869] [2025-03-03 15:16:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281970869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:27,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535313502] [2025-03-03 15:16:27,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:27,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:27,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:27,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:27,384 INFO L87 Difference]: Start difference. First operand 994 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:28,117 INFO L93 Difference]: Finished difference Result 1735 states and 2351 transitions. [2025-03-03 15:16:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:28,121 INFO L225 Difference]: With dead ends: 1735 [2025-03-03 15:16:28,121 INFO L226 Difference]: Without dead ends: 1536 [2025-03-03 15:16:28,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:28,121 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 3401 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3401 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:28,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3401 Valid, 2709 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-03 15:16:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 994. [2025-03-03 15:16:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.368312757201646) internal successors, (1330), 993 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1330 transitions. [2025-03-03 15:16:28,132 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1330 transitions. Word has length 97 [2025-03-03 15:16:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:28,132 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1330 transitions. [2025-03-03 15:16:28,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1330 transitions. [2025-03-03 15:16:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:28,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:28,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:16:28,133 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1001389256, now seen corresponding path program 1 times [2025-03-03 15:16:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056909721] [2025-03-03 15:16:28,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:28,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:28,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:28,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056909721] [2025-03-03 15:16:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056909721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:28,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:28,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:28,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331810215] [2025-03-03 15:16:28,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:28,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:28,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:28,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:28,427 INFO L87 Difference]: Start difference. First operand 994 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:29,249 INFO L93 Difference]: Finished difference Result 1786 states and 2422 transitions. [2025-03-03 15:16:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:29,252 INFO L225 Difference]: With dead ends: 1786 [2025-03-03 15:16:29,252 INFO L226 Difference]: Without dead ends: 1566 [2025-03-03 15:16:29,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:29,253 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 1875 mSDsluCounter, 2663 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:29,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 3480 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-03-03 15:16:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 994. [2025-03-03 15:16:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.367283950617284) internal successors, (1329), 993 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1329 transitions. [2025-03-03 15:16:29,263 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1329 transitions. Word has length 97 [2025-03-03 15:16:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:29,263 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1329 transitions. [2025-03-03 15:16:29,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1329 transitions. [2025-03-03 15:16:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:29,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:29,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:16:29,265 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash -350503254, now seen corresponding path program 1 times [2025-03-03 15:16:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651772217] [2025-03-03 15:16:29,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:29,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:29,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:29,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:29,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:29,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651772217] [2025-03-03 15:16:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651772217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:29,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012074279] [2025-03-03 15:16:29,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:29,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:29,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:29,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:29,444 INFO L87 Difference]: Start difference. First operand 994 states and 1329 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:30,179 INFO L93 Difference]: Finished difference Result 1674 states and 2255 transitions. [2025-03-03 15:16:30,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:30,183 INFO L225 Difference]: With dead ends: 1674 [2025-03-03 15:16:30,183 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:30,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:30,184 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 4813 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:30,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 2411 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3662551440329218) internal successors, (1328), 993 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1328 transitions. [2025-03-03 15:16:30,195 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1328 transitions. Word has length 97 [2025-03-03 15:16:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:30,195 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1328 transitions. [2025-03-03 15:16:30,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1328 transitions. [2025-03-03 15:16:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:30,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:30,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:30,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:16:30,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:30,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1270072806, now seen corresponding path program 1 times [2025-03-03 15:16:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:30,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701994485] [2025-03-03 15:16:30,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:30,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:30,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:30,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:30,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:30,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701994485] [2025-03-03 15:16:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701994485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:30,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901081127] [2025-03-03 15:16:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:30,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:30,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:30,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:30,408 INFO L87 Difference]: Start difference. First operand 994 states and 1328 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:31,218 INFO L93 Difference]: Finished difference Result 1674 states and 2252 transitions. [2025-03-03 15:16:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:31,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:31,222 INFO L225 Difference]: With dead ends: 1674 [2025-03-03 15:16:31,222 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:31,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:31,224 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 3584 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3584 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:31,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3584 Valid, 2411 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3652263374485596) internal successors, (1327), 993 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1327 transitions. [2025-03-03 15:16:31,235 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1327 transitions. Word has length 97 [2025-03-03 15:16:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1327 transitions. [2025-03-03 15:16:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1327 transitions. [2025-03-03 15:16:31,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:16:31,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:31,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:31,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:16:31,236 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:31,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1345615509, now seen corresponding path program 1 times [2025-03-03 15:16:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:31,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075290870] [2025-03-03 15:16:31,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:31,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:16:31,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:16:31,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075290870] [2025-03-03 15:16:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075290870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641633423] [2025-03-03 15:16:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:31,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:31,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:31,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:31,415 INFO L87 Difference]: Start difference. First operand 994 states and 1327 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:32,066 INFO L93 Difference]: Finished difference Result 1669 states and 2246 transitions. [2025-03-03 15:16:32,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:32,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 15:16:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:32,069 INFO L225 Difference]: With dead ends: 1669 [2025-03-03 15:16:32,069 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:32,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:32,072 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 3583 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3583 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:32,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3583 Valid, 2414 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:32,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3641975308641976) internal successors, (1326), 993 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1326 transitions. [2025-03-03 15:16:32,081 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1326 transitions. Word has length 97 [2025-03-03 15:16:32,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:32,081 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1326 transitions. [2025-03-03 15:16:32,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1326 transitions. [2025-03-03 15:16:32,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:32,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:32,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:32,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:16:32,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:32,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:32,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2123066080, now seen corresponding path program 1 times [2025-03-03 15:16:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825467014] [2025-03-03 15:16:32,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:32,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:32,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:32,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:32,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:32,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:32,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825467014] [2025-03-03 15:16:32,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825467014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:32,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:32,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:32,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573747023] [2025-03-03 15:16:32,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:32,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:32,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:32,298 INFO L87 Difference]: Start difference. First operand 994 states and 1326 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:33,020 INFO L93 Difference]: Finished difference Result 1680 states and 2259 transitions. [2025-03-03 15:16:33,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:33,023 INFO L225 Difference]: With dead ends: 1680 [2025-03-03 15:16:33,023 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:33,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:33,024 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 2778 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2778 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:33,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2778 Valid, 2414 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:33,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3621399176954732) internal successors, (1324), 993 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1324 transitions. [2025-03-03 15:16:33,033 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1324 transitions. Word has length 98 [2025-03-03 15:16:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:33,033 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1324 transitions. [2025-03-03 15:16:33,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1324 transitions. [2025-03-03 15:16:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:33,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:33,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:16:33,034 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:33,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1448302864, now seen corresponding path program 1 times [2025-03-03 15:16:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971342379] [2025-03-03 15:16:33,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:33,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:33,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:33,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:33,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:33,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971342379] [2025-03-03 15:16:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971342379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:33,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453278368] [2025-03-03 15:16:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:33,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:33,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:33,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:33,240 INFO L87 Difference]: Start difference. First operand 994 states and 1324 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:33,978 INFO L93 Difference]: Finished difference Result 1713 states and 2311 transitions. [2025-03-03 15:16:33,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:33,981 INFO L225 Difference]: With dead ends: 1713 [2025-03-03 15:16:33,981 INFO L226 Difference]: Without dead ends: 1536 [2025-03-03 15:16:33,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:33,982 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 4316 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4316 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:33,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4316 Valid, 2936 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:33,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-03 15:16:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 994. [2025-03-03 15:16:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3611111111111112) internal successors, (1323), 993 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1323 transitions. [2025-03-03 15:16:33,990 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1323 transitions. Word has length 98 [2025-03-03 15:16:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:33,990 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1323 transitions. [2025-03-03 15:16:33,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1323 transitions. [2025-03-03 15:16:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:33,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:33,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:33,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:16:33,991 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:33,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:33,991 INFO L85 PathProgramCache]: Analyzing trace with hash 437361200, now seen corresponding path program 1 times [2025-03-03 15:16:33,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:33,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437936009] [2025-03-03 15:16:33,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:33,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:34,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:34,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:34,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:34,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437936009] [2025-03-03 15:16:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437936009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803461366] [2025-03-03 15:16:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:34,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:34,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:34,251 INFO L87 Difference]: Start difference. First operand 994 states and 1323 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:35,026 INFO L93 Difference]: Finished difference Result 1670 states and 2243 transitions. [2025-03-03 15:16:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:35,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:35,031 INFO L225 Difference]: With dead ends: 1670 [2025-03-03 15:16:35,031 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:35,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:35,034 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 4046 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:35,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 3062 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.360082304526749) internal successors, (1322), 993 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1322 transitions. [2025-03-03 15:16:35,045 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1322 transitions. Word has length 98 [2025-03-03 15:16:35,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:35,045 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1322 transitions. [2025-03-03 15:16:35,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1322 transitions. [2025-03-03 15:16:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:35,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:35,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:35,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:16:35,046 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:35,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:35,046 INFO L85 PathProgramCache]: Analyzing trace with hash 111652256, now seen corresponding path program 1 times [2025-03-03 15:16:35,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:35,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779733457] [2025-03-03 15:16:35,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:35,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:35,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:35,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:35,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:35,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:35,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:35,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779733457] [2025-03-03 15:16:35,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779733457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:35,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:35,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470247899] [2025-03-03 15:16:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:35,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:35,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:35,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:35,245 INFO L87 Difference]: Start difference. First operand 994 states and 1322 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:36,035 INFO L93 Difference]: Finished difference Result 1713 states and 2308 transitions. [2025-03-03 15:16:36,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:36,038 INFO L225 Difference]: With dead ends: 1713 [2025-03-03 15:16:36,038 INFO L226 Difference]: Without dead ends: 1536 [2025-03-03 15:16:36,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:36,039 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 2883 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2883 SdHoareTripleChecker+Valid, 3434 SdHoareTripleChecker+Invalid, 2419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:36,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2883 Valid, 3434 Invalid, 2419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2025-03-03 15:16:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 994. [2025-03-03 15:16:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3590534979423867) internal successors, (1321), 993 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1321 transitions. [2025-03-03 15:16:36,047 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1321 transitions. Word has length 98 [2025-03-03 15:16:36,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:36,047 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1321 transitions. [2025-03-03 15:16:36,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1321 transitions. [2025-03-03 15:16:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:36,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:36,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:16:36,048 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -139865824, now seen corresponding path program 1 times [2025-03-03 15:16:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112348136] [2025-03-03 15:16:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:36,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:36,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:36,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:36,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:36,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:36,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:36,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112348136] [2025-03-03 15:16:36,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112348136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:36,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:36,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881648379] [2025-03-03 15:16:36,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:36,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:36,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:36,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:36,245 INFO L87 Difference]: Start difference. First operand 994 states and 1321 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:36,961 INFO L93 Difference]: Finished difference Result 1670 states and 2241 transitions. [2025-03-03 15:16:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:36,963 INFO L225 Difference]: With dead ends: 1670 [2025-03-03 15:16:36,963 INFO L226 Difference]: Without dead ends: 1512 [2025-03-03 15:16:36,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:36,964 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 4557 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4557 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:36,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4557 Valid, 2588 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-03-03 15:16:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 994. [2025-03-03 15:16:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3580246913580247) internal successors, (1320), 993 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1320 transitions. [2025-03-03 15:16:36,972 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1320 transitions. Word has length 98 [2025-03-03 15:16:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:36,972 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1320 transitions. [2025-03-03 15:16:36,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1320 transitions. [2025-03-03 15:16:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:36,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:36,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:36,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:16:36,973 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 885360693, now seen corresponding path program 1 times [2025-03-03 15:16:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:36,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151785967] [2025-03-03 15:16:36,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:36,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:36,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:37,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:37,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:37,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151785967] [2025-03-03 15:16:37,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151785967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99590963] [2025-03-03 15:16:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:37,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:37,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:37,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:37,179 INFO L87 Difference]: Start difference. First operand 994 states and 1320 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:37,855 INFO L93 Difference]: Finished difference Result 1613 states and 2146 transitions. [2025-03-03 15:16:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:37,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:37,857 INFO L225 Difference]: With dead ends: 1613 [2025-03-03 15:16:37,857 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:37,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:37,858 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 4745 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4745 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:37,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4745 Valid, 2307 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 994. [2025-03-03 15:16:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 972 states have (on average 1.3569958847736625) internal successors, (1319), 993 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1319 transitions. [2025-03-03 15:16:37,868 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1319 transitions. Word has length 98 [2025-03-03 15:16:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:37,868 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1319 transitions. [2025-03-03 15:16:37,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1319 transitions. [2025-03-03 15:16:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 15:16:37,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:37,869 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:37,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:16:37,869 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:37,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:37,870 INFO L85 PathProgramCache]: Analyzing trace with hash -343361328, now seen corresponding path program 1 times [2025-03-03 15:16:37,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:37,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123530472] [2025-03-03 15:16:37,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:37,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 15:16:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 15:16:37,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:37,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:38,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123530472] [2025-03-03 15:16:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123530472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125865138] [2025-03-03 15:16:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:38,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:38,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:38,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:38,294 INFO L87 Difference]: Start difference. First operand 994 states and 1319 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:39,389 INFO L93 Difference]: Finished difference Result 2122 states and 2899 transitions. [2025-03-03 15:16:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-03 15:16:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:39,392 INFO L225 Difference]: With dead ends: 2122 [2025-03-03 15:16:39,392 INFO L226 Difference]: Without dead ends: 1964 [2025-03-03 15:16:39,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:39,393 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 8224 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8224 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:39,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8224 Valid, 2815 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:16:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2025-03-03 15:16:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 999. [2025-03-03 15:16:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3551688843398157) internal successors, (1324), 998 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1324 transitions. [2025-03-03 15:16:39,403 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1324 transitions. Word has length 98 [2025-03-03 15:16:39,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:39,404 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1324 transitions. [2025-03-03 15:16:39,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 11 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1324 transitions. [2025-03-03 15:16:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:39,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:39,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:39,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:16:39,405 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:39,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 294019382, now seen corresponding path program 1 times [2025-03-03 15:16:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703341035] [2025-03-03 15:16:39,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:39,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:39,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:39,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:39,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:39,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:39,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703341035] [2025-03-03 15:16:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703341035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:39,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:39,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:39,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976705937] [2025-03-03 15:16:39,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:39,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:39,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:39,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:39,739 INFO L87 Difference]: Start difference. First operand 999 states and 1324 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:40,965 INFO L93 Difference]: Finished difference Result 2475 states and 3406 transitions. [2025-03-03 15:16:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:40,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:40,968 INFO L225 Difference]: With dead ends: 2475 [2025-03-03 15:16:40,968 INFO L226 Difference]: Without dead ends: 2183 [2025-03-03 15:16:40,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:40,969 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 5638 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 2674 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5638 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:40,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5638 Valid, 3726 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2674 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:16:40,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2025-03-03 15:16:40,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1009. [2025-03-03 15:16:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.3515704154002026) internal successors, (1334), 1008 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1334 transitions. [2025-03-03 15:16:40,978 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1334 transitions. Word has length 99 [2025-03-03 15:16:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1334 transitions. [2025-03-03 15:16:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1334 transitions. [2025-03-03 15:16:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:40,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:40,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:40,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:16:40,979 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:40,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:40,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1913368778, now seen corresponding path program 1 times [2025-03-03 15:16:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:40,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625289769] [2025-03-03 15:16:40,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:40,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:40,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:41,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:41,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:41,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625289769] [2025-03-03 15:16:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625289769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509541851] [2025-03-03 15:16:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:41,161 INFO L87 Difference]: Start difference. First operand 1009 states and 1334 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:41,879 INFO L93 Difference]: Finished difference Result 1762 states and 2364 transitions. [2025-03-03 15:16:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:41,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:41,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:41,881 INFO L225 Difference]: With dead ends: 1762 [2025-03-03 15:16:41,881 INFO L226 Difference]: Without dead ends: 1551 [2025-03-03 15:16:41,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:41,882 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 2078 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 2024 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:41,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 2936 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-03 15:16:41,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1009. [2025-03-03 15:16:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.3495440729483283) internal successors, (1332), 1008 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1332 transitions. [2025-03-03 15:16:41,892 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1332 transitions. Word has length 99 [2025-03-03 15:16:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:41,892 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1332 transitions. [2025-03-03 15:16:41,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1332 transitions. [2025-03-03 15:16:41,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:41,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:41,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:16:41,894 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash 561762294, now seen corresponding path program 1 times [2025-03-03 15:16:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054907252] [2025-03-03 15:16:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:41,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:42,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-03-03 15:16:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054907252] [2025-03-03 15:16:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054907252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110002514] [2025-03-03 15:16:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:42,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:42,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:42,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:42,101 INFO L87 Difference]: Start difference. First operand 1009 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:42,865 INFO L93 Difference]: Finished difference Result 1696 states and 2266 transitions. [2025-03-03 15:16:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:42,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:42,868 INFO L225 Difference]: With dead ends: 1696 [2025-03-03 15:16:42,868 INFO L226 Difference]: Without dead ends: 1522 [2025-03-03 15:16:42,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:42,869 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 3949 mSDsluCounter, 2606 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 3236 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:42,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3949 Valid, 3236 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-03-03 15:16:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1009. [2025-03-03 15:16:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.3475177304964538) internal successors, (1330), 1008 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1330 transitions. [2025-03-03 15:16:42,899 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1330 transitions. Word has length 99 [2025-03-03 15:16:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:42,899 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1330 transitions. [2025-03-03 15:16:42,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1330 transitions. [2025-03-03 15:16:42,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:42,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:42,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:42,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:16:42,901 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1566821350, now seen corresponding path program 1 times [2025-03-03 15:16:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:42,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263328138] [2025-03-03 15:16:42,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:42,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:42,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:42,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:42,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:43,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263328138] [2025-03-03 15:16:43,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263328138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:43,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:43,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:43,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051348805] [2025-03-03 15:16:43,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:43,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:43,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:43,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:43,097 INFO L87 Difference]: Start difference. First operand 1009 states and 1330 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:43,840 INFO L93 Difference]: Finished difference Result 1748 states and 2339 transitions. [2025-03-03 15:16:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:43,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:43,844 INFO L225 Difference]: With dead ends: 1748 [2025-03-03 15:16:43,844 INFO L226 Difference]: Without dead ends: 1551 [2025-03-03 15:16:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:43,845 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 2964 mSDsluCounter, 2530 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2964 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:43,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2964 Valid, 3213 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-03 15:16:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1009. [2025-03-03 15:16:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.3454913880445796) internal successors, (1328), 1008 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1328 transitions. [2025-03-03 15:16:43,854 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1328 transitions. Word has length 99 [2025-03-03 15:16:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:43,854 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1328 transitions. [2025-03-03 15:16:43,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1328 transitions. [2025-03-03 15:16:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:43,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:43,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:16:43,856 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:43,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:43,857 INFO L85 PathProgramCache]: Analyzing trace with hash -876145562, now seen corresponding path program 1 times [2025-03-03 15:16:43,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538762904] [2025-03-03 15:16:43,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:43,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:43,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:43,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:43,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538762904] [2025-03-03 15:16:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538762904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408820895] [2025-03-03 15:16:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:44,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:44,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:44,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:44,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:44,076 INFO L87 Difference]: Start difference. First operand 1009 states and 1328 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:44,874 INFO L93 Difference]: Finished difference Result 1691 states and 2255 transitions. [2025-03-03 15:16:44,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:44,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:44,877 INFO L225 Difference]: With dead ends: 1691 [2025-03-03 15:16:44,878 INFO L226 Difference]: Without dead ends: 1522 [2025-03-03 15:16:44,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:44,878 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 3894 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3894 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:44,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3894 Valid, 3347 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:44,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-03-03 15:16:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1009. [2025-03-03 15:16:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.343465045592705) internal successors, (1326), 1008 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1326 transitions. [2025-03-03 15:16:44,887 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1326 transitions. Word has length 99 [2025-03-03 15:16:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:44,887 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1326 transitions. [2025-03-03 15:16:44,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1326 transitions. [2025-03-03 15:16:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:44,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:44,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] [2025-03-03 15:16:44,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:16:44,889 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1476764438, now seen corresponding path program 1 times [2025-03-03 15:16:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021767858] [2025-03-03 15:16:44,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:44,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021767858] [2025-03-03 15:16:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021767858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:45,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609293866] [2025-03-03 15:16:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:45,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:45,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:45,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:45,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:45,109 INFO L87 Difference]: Start difference. First operand 1009 states and 1326 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:45,819 INFO L93 Difference]: Finished difference Result 1691 states and 2253 transitions. [2025-03-03 15:16:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:45,821 INFO L225 Difference]: With dead ends: 1691 [2025-03-03 15:16:45,821 INFO L226 Difference]: Without dead ends: 1522 [2025-03-03 15:16:45,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:45,822 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 3020 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3020 SdHoareTripleChecker+Valid, 3055 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:45,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3020 Valid, 3055 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2025-03-03 15:16:45,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1009. [2025-03-03 15:16:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.3414387031408308) internal successors, (1324), 1008 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1324 transitions. [2025-03-03 15:16:45,832 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1324 transitions. Word has length 99 [2025-03-03 15:16:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:45,833 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1324 transitions. [2025-03-03 15:16:45,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1324 transitions. [2025-03-03 15:16:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:45,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:45,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:16:45,834 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1772590946, now seen corresponding path program 1 times [2025-03-03 15:16:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729092426] [2025-03-03 15:16:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:45,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:45,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:45,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:46,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729092426] [2025-03-03 15:16:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729092426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:46,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:46,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800725456] [2025-03-03 15:16:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:46,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:46,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:46,009 INFO L87 Difference]: Start difference. First operand 1009 states and 1324 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:46,671 INFO L93 Difference]: Finished difference Result 1627 states and 2149 transitions. [2025-03-03 15:16:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:46,673 INFO L225 Difference]: With dead ends: 1627 [2025-03-03 15:16:46,673 INFO L226 Difference]: Without dead ends: 1477 [2025-03-03 15:16:46,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:46,674 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 3175 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3175 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:46,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3175 Valid, 2687 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2025-03-03 15:16:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1007. [2025-03-03 15:16:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 985 states have (on average 1.3401015228426396) internal successors, (1320), 1006 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1320 transitions. [2025-03-03 15:16:46,682 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1320 transitions. Word has length 99 [2025-03-03 15:16:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:46,683 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1320 transitions. [2025-03-03 15:16:46,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1320 transitions. [2025-03-03 15:16:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:46,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:46,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:16:46,684 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1335488180, now seen corresponding path program 1 times [2025-03-03 15:16:46,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859054774] [2025-03-03 15:16:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:46,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:46,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:46,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:46,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859054774] [2025-03-03 15:16:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859054774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:46,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968743885] [2025-03-03 15:16:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:46,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:46,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:46,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:46,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:46,866 INFO L87 Difference]: Start difference. First operand 1007 states and 1320 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:47,632 INFO L93 Difference]: Finished difference Result 1735 states and 2310 transitions. [2025-03-03 15:16:47,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:47,635 INFO L225 Difference]: With dead ends: 1735 [2025-03-03 15:16:47,635 INFO L226 Difference]: Without dead ends: 1549 [2025-03-03 15:16:47,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:47,635 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 2900 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 3171 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:47,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2900 Valid, 3171 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-03 15:16:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1007. [2025-03-03 15:16:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 985 states have (on average 1.3390862944162436) internal successors, (1319), 1006 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1319 transitions. [2025-03-03 15:16:47,643 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1319 transitions. Word has length 99 [2025-03-03 15:16:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:47,643 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1319 transitions. [2025-03-03 15:16:47,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1319 transitions. [2025-03-03 15:16:47,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:47,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:47,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:47,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:16:47,644 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:47,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:47,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1124944790, now seen corresponding path program 1 times [2025-03-03 15:16:47,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:47,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674306977] [2025-03-03 15:16:47,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:47,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:47,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674306977] [2025-03-03 15:16:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674306977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479057100] [2025-03-03 15:16:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:47,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:47,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:47,819 INFO L87 Difference]: Start difference. First operand 1007 states and 1319 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:48,580 INFO L93 Difference]: Finished difference Result 1682 states and 2235 transitions. [2025-03-03 15:16:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:48,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:48,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:48,583 INFO L225 Difference]: With dead ends: 1682 [2025-03-03 15:16:48,583 INFO L226 Difference]: Without dead ends: 1520 [2025-03-03 15:16:48,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:48,584 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2959 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2959 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:48,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2959 Valid, 3472 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-03-03 15:16:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1007. [2025-03-03 15:16:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 985 states have (on average 1.3380710659898478) internal successors, (1318), 1006 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1318 transitions. [2025-03-03 15:16:48,594 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1318 transitions. Word has length 99 [2025-03-03 15:16:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1318 transitions. [2025-03-03 15:16:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1318 transitions. [2025-03-03 15:16:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:48,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:48,596 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:16:48,596 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:48,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:48,596 INFO L85 PathProgramCache]: Analyzing trace with hash -973055624, now seen corresponding path program 1 times [2025-03-03 15:16:48,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920980337] [2025-03-03 15:16:48,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:48,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:48,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:48,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:48,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920980337] [2025-03-03 15:16:48,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920980337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:48,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:48,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250252438] [2025-03-03 15:16:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:48,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:48,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:48,769 INFO L87 Difference]: Start difference. First operand 1007 states and 1318 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:49,422 INFO L93 Difference]: Finished difference Result 1625 states and 2143 transitions. [2025-03-03 15:16:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:49,423 INFO L225 Difference]: With dead ends: 1625 [2025-03-03 15:16:49,423 INFO L226 Difference]: Without dead ends: 1476 [2025-03-03 15:16:49,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:16:49,424 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2272 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:49,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 2471 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-03-03 15:16:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1006. [2025-03-03 15:16:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 984 states have (on average 1.3373983739837398) internal successors, (1316), 1005 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1316 transitions. [2025-03-03 15:16:49,431 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1316 transitions. Word has length 99 [2025-03-03 15:16:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:49,431 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1316 transitions. [2025-03-03 15:16:49,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1316 transitions. [2025-03-03 15:16:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:49,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:49,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:49,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:16:49,432 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 737804008, now seen corresponding path program 1 times [2025-03-03 15:16:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362884157] [2025-03-03 15:16:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:49,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:49,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:49,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362884157] [2025-03-03 15:16:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362884157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:16:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527367477] [2025-03-03 15:16:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:49,870 INFO L87 Difference]: Start difference. First operand 1006 states and 1316 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:50,553 INFO L93 Difference]: Finished difference Result 1663 states and 2211 transitions. [2025-03-03 15:16:50,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:50,555 INFO L225 Difference]: With dead ends: 1663 [2025-03-03 15:16:50,555 INFO L226 Difference]: Without dead ends: 1510 [2025-03-03 15:16:50,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:16:50,556 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 4809 mSDsluCounter, 4462 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4809 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:50,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4809 Valid, 5441 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:16:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-03-03 15:16:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1001. [2025-03-03 15:16:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 979 states have (on average 1.3360572012257406) internal successors, (1308), 1000 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1308 transitions. [2025-03-03 15:16:50,564 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1308 transitions. Word has length 99 [2025-03-03 15:16:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1308 transitions. [2025-03-03 15:16:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1308 transitions. [2025-03-03 15:16:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:50,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:50,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:16:50,566 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2101102296, now seen corresponding path program 1 times [2025-03-03 15:16:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623899824] [2025-03-03 15:16:50,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:50,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:50,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:50,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:50,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623899824] [2025-03-03 15:16:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623899824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:50,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:50,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:16:50,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972532529] [2025-03-03 15:16:50,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:50,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:16:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:50,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:16:50,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:16:50,886 INFO L87 Difference]: Start difference. First operand 1001 states and 1308 transitions. Second operand has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:52,039 INFO L93 Difference]: Finished difference Result 1991 states and 2673 transitions. [2025-03-03 15:16:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:16:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:52,041 INFO L225 Difference]: With dead ends: 1991 [2025-03-03 15:16:52,041 INFO L226 Difference]: Without dead ends: 1842 [2025-03-03 15:16:52,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:16:52,042 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 6447 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 2343 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6447 SdHoareTripleChecker+Valid, 3157 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:52,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6447 Valid, 3157 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 2343 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:16:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-03 15:16:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1006. [2025-03-03 15:16:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 984 states have (on average 1.3343495934959348) internal successors, (1313), 1005 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1313 transitions. [2025-03-03 15:16:52,050 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1313 transitions. Word has length 99 [2025-03-03 15:16:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:52,050 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1313 transitions. [2025-03-03 15:16:52,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.25) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1313 transitions. [2025-03-03 15:16:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:52,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:52,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:52,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:16:52,052 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:52,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:52,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1069350953, now seen corresponding path program 1 times [2025-03-03 15:16:52,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:52,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472426424] [2025-03-03 15:16:52,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:52,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:52,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:52,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:52,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:52,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:52,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472426424] [2025-03-03 15:16:52,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472426424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:52,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:52,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:52,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919660930] [2025-03-03 15:16:52,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:52,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:52,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:52,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:52,243 INFO L87 Difference]: Start difference. First operand 1006 states and 1313 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:53,002 INFO L93 Difference]: Finished difference Result 1677 states and 2225 transitions. [2025-03-03 15:16:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:53,004 INFO L225 Difference]: With dead ends: 1677 [2025-03-03 15:16:53,004 INFO L226 Difference]: Without dead ends: 1519 [2025-03-03 15:16:53,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:53,004 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 2812 mSDsluCounter, 2402 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 3152 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:53,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 3152 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:16:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-03 15:16:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1001. [2025-03-03 15:16:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 979 states have (on average 1.335035750766088) internal successors, (1307), 1000 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1307 transitions. [2025-03-03 15:16:53,011 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1307 transitions. Word has length 99 [2025-03-03 15:16:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:53,011 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1307 transitions. [2025-03-03 15:16:53,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1307 transitions. [2025-03-03 15:16:53,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 15:16:53,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:53,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:53,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:16:53,012 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:53,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1124504408, now seen corresponding path program 1 times [2025-03-03 15:16:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805925983] [2025-03-03 15:16:53,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:53,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 15:16:53,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 15:16:53,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:53,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:53,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805925983] [2025-03-03 15:16:53,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805925983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:53,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:53,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:53,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528953942] [2025-03-03 15:16:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:53,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:53,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:53,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:53,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:53,200 INFO L87 Difference]: Start difference. First operand 1001 states and 1307 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:53,841 INFO L93 Difference]: Finished difference Result 1613 states and 2125 transitions. [2025-03-03 15:16:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:53,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-03-03 15:16:53,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:53,843 INFO L225 Difference]: With dead ends: 1613 [2025-03-03 15:16:53,844 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:53,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:53,844 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 4399 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4399 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:53,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4399 Valid, 2478 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:53,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1000. [2025-03-03 15:16:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 978 states have (on average 1.334355828220859) internal successors, (1305), 999 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1305 transitions. [2025-03-03 15:16:53,852 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1305 transitions. Word has length 99 [2025-03-03 15:16:53,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:53,852 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1305 transitions. [2025-03-03 15:16:53,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:53,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1305 transitions. [2025-03-03 15:16:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:53,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:53,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:16:53,853 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1493446844, now seen corresponding path program 1 times [2025-03-03 15:16:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383707493] [2025-03-03 15:16:53,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:53,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383707493] [2025-03-03 15:16:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383707493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263778051] [2025-03-03 15:16:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:54,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:54,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:54,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:54,057 INFO L87 Difference]: Start difference. First operand 1000 states and 1305 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:54,699 INFO L93 Difference]: Finished difference Result 1618 states and 2129 transitions. [2025-03-03 15:16:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:54,701 INFO L225 Difference]: With dead ends: 1618 [2025-03-03 15:16:54,701 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:54,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:54,702 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 4393 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4393 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:54,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4393 Valid, 2478 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:16:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:54,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1000. [2025-03-03 15:16:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 978 states have (on average 1.3323108384458078) internal successors, (1303), 999 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1303 transitions. [2025-03-03 15:16:54,709 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1303 transitions. Word has length 100 [2025-03-03 15:16:54,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:54,709 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1303 transitions. [2025-03-03 15:16:54,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1303 transitions. [2025-03-03 15:16:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:54,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:54,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:54,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:16:54,710 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash 326401332, now seen corresponding path program 1 times [2025-03-03 15:16:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752133023] [2025-03-03 15:16:54,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:54,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:54,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:54,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:54,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:54,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:54,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752133023] [2025-03-03 15:16:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752133023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:54,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:54,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:54,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692722539] [2025-03-03 15:16:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:54,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:54,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:54,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:54,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:54,905 INFO L87 Difference]: Start difference. First operand 1000 states and 1303 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:55,611 INFO L93 Difference]: Finished difference Result 1618 states and 2127 transitions. [2025-03-03 15:16:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:55,612 INFO L225 Difference]: With dead ends: 1618 [2025-03-03 15:16:55,612 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:55,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:55,613 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 4389 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4389 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:55,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4389 Valid, 2482 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1000. [2025-03-03 15:16:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 978 states have (on average 1.3302658486707566) internal successors, (1301), 999 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1301 transitions. [2025-03-03 15:16:55,623 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1301 transitions. Word has length 100 [2025-03-03 15:16:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:55,624 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1301 transitions. [2025-03-03 15:16:55,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:55,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1301 transitions. [2025-03-03 15:16:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:55,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:55,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:16:55,625 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:55,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 253094820, now seen corresponding path program 1 times [2025-03-03 15:16:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977953940] [2025-03-03 15:16:55,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:55,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:55,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:55,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:55,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977953940] [2025-03-03 15:16:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977953940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661061040] [2025-03-03 15:16:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:55,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:55,816 INFO L87 Difference]: Start difference. First operand 1000 states and 1301 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:56,498 INFO L93 Difference]: Finished difference Result 1618 states and 2125 transitions. [2025-03-03 15:16:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:56,500 INFO L225 Difference]: With dead ends: 1618 [2025-03-03 15:16:56,500 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:56,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:56,502 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4090 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4090 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:56,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4090 Valid, 2684 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1000. [2025-03-03 15:16:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 978 states have (on average 1.3282208588957056) internal successors, (1299), 999 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1299 transitions. [2025-03-03 15:16:56,510 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1299 transitions. Word has length 100 [2025-03-03 15:16:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:56,510 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1299 transitions. [2025-03-03 15:16:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1299 transitions. [2025-03-03 15:16:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:56,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:56,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:56,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:16:56,511 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:56,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash 95060308, now seen corresponding path program 1 times [2025-03-03 15:16:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:56,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595064433] [2025-03-03 15:16:56,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:56,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:56,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:56,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:56,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595064433] [2025-03-03 15:16:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595064433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118257302] [2025-03-03 15:16:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:56,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:56,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:56,711 INFO L87 Difference]: Start difference. First operand 1000 states and 1299 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:57,375 INFO L93 Difference]: Finished difference Result 1618 states and 2123 transitions. [2025-03-03 15:16:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:57,377 INFO L225 Difference]: With dead ends: 1618 [2025-03-03 15:16:57,377 INFO L226 Difference]: Without dead ends: 1464 [2025-03-03 15:16:57,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:57,378 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 3078 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3078 SdHoareTripleChecker+Valid, 2723 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:57,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3078 Valid, 2723 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-03 15:16:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1000. [2025-03-03 15:16:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 978 states have (on average 1.3261758691206544) internal successors, (1297), 999 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1297 transitions. [2025-03-03 15:16:57,384 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1297 transitions. Word has length 100 [2025-03-03 15:16:57,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:57,384 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1297 transitions. [2025-03-03 15:16:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1297 transitions. [2025-03-03 15:16:57,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:57,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:57,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:57,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:16:57,385 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:57,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:57,386 INFO L85 PathProgramCache]: Analyzing trace with hash 765021107, now seen corresponding path program 1 times [2025-03-03 15:16:57,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:57,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811765791] [2025-03-03 15:16:57,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:57,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:57,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:57,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:57,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:57,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811765791] [2025-03-03 15:16:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811765791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:57,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466854834] [2025-03-03 15:16:57,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:57,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:57,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:57,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:57,555 INFO L87 Difference]: Start difference. First operand 1000 states and 1297 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:58,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:58,311 INFO L93 Difference]: Finished difference Result 1854 states and 2459 transitions. [2025-03-03 15:16:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:16:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:58,313 INFO L225 Difference]: With dead ends: 1854 [2025-03-03 15:16:58,313 INFO L226 Difference]: Without dead ends: 1562 [2025-03-03 15:16:58,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:58,314 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 2645 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2645 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:58,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2645 Valid, 3524 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-03-03 15:16:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 990. [2025-03-03 15:16:58,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3274793388429753) internal successors, (1285), 989 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1285 transitions. [2025-03-03 15:16:58,326 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1285 transitions. Word has length 100 [2025-03-03 15:16:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1285 transitions. [2025-03-03 15:16:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:58,326 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1285 transitions. [2025-03-03 15:16:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:58,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:58,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:58,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:16:58,327 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:58,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 594234900, now seen corresponding path program 1 times [2025-03-03 15:16:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164636030] [2025-03-03 15:16:58,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:58,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:58,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164636030] [2025-03-03 15:16:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164636030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:58,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227239315] [2025-03-03 15:16:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:58,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:58,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:58,529 INFO L87 Difference]: Start difference. First operand 990 states and 1285 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:16:59,213 INFO L93 Difference]: Finished difference Result 1605 states and 2104 transitions. [2025-03-03 15:16:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:16:59,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:16:59,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:16:59,214 INFO L225 Difference]: With dead ends: 1605 [2025-03-03 15:16:59,214 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:16:59,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:16:59,215 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 4080 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4080 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:16:59,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4080 Valid, 2680 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:16:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:16:59,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:16:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3264462809917354) internal successors, (1284), 989 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1284 transitions. [2025-03-03 15:16:59,222 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1284 transitions. Word has length 100 [2025-03-03 15:16:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:16:59,222 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1284 transitions. [2025-03-03 15:16:59,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:16:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1284 transitions. [2025-03-03 15:16:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:16:59,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:16:59,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:16:59,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:16:59,223 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:16:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:16:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1202496284, now seen corresponding path program 1 times [2025-03-03 15:16:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:16:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922654916] [2025-03-03 15:16:59,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:16:59,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:16:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:16:59,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:16:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:16:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:16:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:16:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:16:59,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922654916] [2025-03-03 15:16:59,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922654916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:16:59,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:16:59,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:16:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008658892] [2025-03-03 15:16:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:16:59,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:16:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:16:59,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:16:59,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:16:59,393 INFO L87 Difference]: Start difference. First operand 990 states and 1284 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:00,038 INFO L93 Difference]: Finished difference Result 1605 states and 2103 transitions. [2025-03-03 15:17:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:00,039 INFO L225 Difference]: With dead ends: 1605 [2025-03-03 15:17:00,039 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:17:00,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:00,040 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 3244 mSDsluCounter, 1861 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3244 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3244 Valid, 2458 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:17:00,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:17:00,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3254132231404958) internal successors, (1283), 989 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1283 transitions. [2025-03-03 15:17:00,046 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1283 transitions. Word has length 100 [2025-03-03 15:17:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1283 transitions. [2025-03-03 15:17:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1283 transitions. [2025-03-03 15:17:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:00,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:00,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:00,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:17:00,047 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:00,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:00,047 INFO L85 PathProgramCache]: Analyzing trace with hash 324064756, now seen corresponding path program 1 times [2025-03-03 15:17:00,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:00,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566134553] [2025-03-03 15:17:00,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:00,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:00,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:00,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:00,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566134553] [2025-03-03 15:17:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566134553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:00,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905804912] [2025-03-03 15:17:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:00,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:00,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:00,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:00,228 INFO L87 Difference]: Start difference. First operand 990 states and 1283 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:00,925 INFO L93 Difference]: Finished difference Result 1603 states and 2099 transitions. [2025-03-03 15:17:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:00,926 INFO L225 Difference]: With dead ends: 1603 [2025-03-03 15:17:00,926 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:17:00,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:00,927 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 3067 mSDsluCounter, 2391 mSDsCounter, 0 mSdLazyCounter, 2028 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:00,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3067 Valid, 2993 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:17:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:17:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3243801652892562) internal successors, (1282), 989 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1282 transitions. [2025-03-03 15:17:00,934 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1282 transitions. Word has length 100 [2025-03-03 15:17:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:00,934 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1282 transitions. [2025-03-03 15:17:00,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1282 transitions. [2025-03-03 15:17:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:00,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:00,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:00,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:17:00,935 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:00,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1318963099, now seen corresponding path program 1 times [2025-03-03 15:17:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:00,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071912425] [2025-03-03 15:17:00,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:00,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:00,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:00,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:00,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071912425] [2025-03-03 15:17:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071912425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297861006] [2025-03-03 15:17:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:01,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:01,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:01,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:01,115 INFO L87 Difference]: Start difference. First operand 990 states and 1282 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:01,754 INFO L93 Difference]: Finished difference Result 1605 states and 2100 transitions. [2025-03-03 15:17:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:01,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:01,756 INFO L225 Difference]: With dead ends: 1605 [2025-03-03 15:17:01,756 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:17:01,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:01,757 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 3062 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 1872 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3062 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:01,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3062 Valid, 2737 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:17:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:17:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3233471074380165) internal successors, (1281), 989 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1281 transitions. [2025-03-03 15:17:01,765 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1281 transitions. Word has length 100 [2025-03-03 15:17:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:01,765 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1281 transitions. [2025-03-03 15:17:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1281 transitions. [2025-03-03 15:17:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:01,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:01,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:01,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:17:01,766 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2002868028, now seen corresponding path program 1 times [2025-03-03 15:17:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765600416] [2025-03-03 15:17:01,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:01,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:01,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:01,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:01,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765600416] [2025-03-03 15:17:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765600416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:01,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873375895] [2025-03-03 15:17:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:01,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:01,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:01,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:01,955 INFO L87 Difference]: Start difference. First operand 990 states and 1281 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:02,626 INFO L93 Difference]: Finished difference Result 1605 states and 2099 transitions. [2025-03-03 15:17:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:02,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:02,627 INFO L225 Difference]: With dead ends: 1605 [2025-03-03 15:17:02,627 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:17:02,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:02,628 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 4064 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4064 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:02,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4064 Valid, 2684 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:17:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:17:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.322314049586777) internal successors, (1280), 989 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1280 transitions. [2025-03-03 15:17:02,635 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1280 transitions. Word has length 100 [2025-03-03 15:17:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:02,635 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1280 transitions. [2025-03-03 15:17:02,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1280 transitions. [2025-03-03 15:17:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:02,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:02,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:17:02,636 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1641814060, now seen corresponding path program 1 times [2025-03-03 15:17:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761744941] [2025-03-03 15:17:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:02,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:02,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:02,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:02,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:02,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:02,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761744941] [2025-03-03 15:17:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761744941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819840932] [2025-03-03 15:17:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:02,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:02,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:02,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:02,825 INFO L87 Difference]: Start difference. First operand 990 states and 1280 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:03,432 INFO L93 Difference]: Finished difference Result 1605 states and 2098 transitions. [2025-03-03 15:17:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:03,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:03,434 INFO L225 Difference]: With dead ends: 1605 [2025-03-03 15:17:03,434 INFO L226 Difference]: Without dead ends: 1454 [2025-03-03 15:17:03,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:03,434 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 3847 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3847 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:03,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3847 Valid, 2473 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2025-03-03 15:17:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 990. [2025-03-03 15:17:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 968 states have (on average 1.3212809917355373) internal successors, (1279), 989 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1279 transitions. [2025-03-03 15:17:03,442 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1279 transitions. Word has length 100 [2025-03-03 15:17:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:03,442 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1279 transitions. [2025-03-03 15:17:03,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1279 transitions. [2025-03-03 15:17:03,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:03,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:03,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:03,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:17:03,443 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:03,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1311798318, now seen corresponding path program 1 times [2025-03-03 15:17:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:03,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088827601] [2025-03-03 15:17:03,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:03,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:03,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:03,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:03,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:03,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088827601] [2025-03-03 15:17:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088827601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:03,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109831406] [2025-03-03 15:17:03,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:03,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:03,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:03,626 INFO L87 Difference]: Start difference. First operand 990 states and 1279 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:04,314 INFO L93 Difference]: Finished difference Result 1602 states and 2093 transitions. [2025-03-03 15:17:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:04,315 INFO L225 Difference]: With dead ends: 1602 [2025-03-03 15:17:04,315 INFO L226 Difference]: Without dead ends: 1453 [2025-03-03 15:17:04,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:04,316 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 4051 mSDsluCounter, 2012 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4051 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:04,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4051 Valid, 2660 Invalid, 1914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-03 15:17:04,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 984. [2025-03-03 15:17:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 962 states have (on average 1.3222453222453223) internal successors, (1272), 983 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1272 transitions. [2025-03-03 15:17:04,323 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1272 transitions. Word has length 100 [2025-03-03 15:17:04,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:04,323 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1272 transitions. [2025-03-03 15:17:04,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:04,323 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1272 transitions. [2025-03-03 15:17:04,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 15:17:04,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:04,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 15:17:04,324 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:04,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:04,324 INFO L85 PathProgramCache]: Analyzing trace with hash -523844508, now seen corresponding path program 1 times [2025-03-03 15:17:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419607254] [2025-03-03 15:17:04,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 15:17:04,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 15:17:04,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:04,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:04,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:04,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419607254] [2025-03-03 15:17:04,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419607254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:04,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:04,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:04,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096714186] [2025-03-03 15:17:04,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:04,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:04,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:04,589 INFO L87 Difference]: Start difference. First operand 984 states and 1272 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:05,545 INFO L93 Difference]: Finished difference Result 1976 states and 2634 transitions. [2025-03-03 15:17:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-03 15:17:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:05,547 INFO L225 Difference]: With dead ends: 1976 [2025-03-03 15:17:05,547 INFO L226 Difference]: Without dead ends: 1825 [2025-03-03 15:17:05,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:05,548 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 7710 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7710 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:05,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7710 Valid, 2634 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2025-03-03 15:17:05,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 989. [2025-03-03 15:17:05,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3205791106514995) internal successors, (1277), 988 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1277 transitions. [2025-03-03 15:17:05,556 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1277 transitions. Word has length 100 [2025-03-03 15:17:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:05,556 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1277 transitions. [2025-03-03 15:17:05,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1277 transitions. [2025-03-03 15:17:05,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:05,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:05,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 15:17:05,557 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 154448354, now seen corresponding path program 1 times [2025-03-03 15:17:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284660030] [2025-03-03 15:17:05,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:05,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:05,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:05,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:05,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284660030] [2025-03-03 15:17:05,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284660030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:05,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:05,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:05,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283574] [2025-03-03 15:17:05,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:05,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:05,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:05,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:05,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:05,732 INFO L87 Difference]: Start difference. First operand 989 states and 1277 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:06,464 INFO L93 Difference]: Finished difference Result 1749 states and 2300 transitions. [2025-03-03 15:17:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:06,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:06,466 INFO L225 Difference]: With dead ends: 1749 [2025-03-03 15:17:06,466 INFO L226 Difference]: Without dead ends: 1530 [2025-03-03 15:17:06,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:06,467 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 3115 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3115 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:06,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3115 Valid, 3410 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-03-03 15:17:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 989. [2025-03-03 15:17:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3185108583247156) internal successors, (1275), 988 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1275 transitions. [2025-03-03 15:17:06,474 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1275 transitions. Word has length 101 [2025-03-03 15:17:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1275 transitions. [2025-03-03 15:17:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1275 transitions. [2025-03-03 15:17:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:06,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:06,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:06,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-03 15:17:06,475 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:06,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1307702686, now seen corresponding path program 1 times [2025-03-03 15:17:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:06,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877775630] [2025-03-03 15:17:06,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:06,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:06,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:06,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:06,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:06,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877775630] [2025-03-03 15:17:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877775630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:06,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:06,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:06,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851611176] [2025-03-03 15:17:06,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:06,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:06,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:06,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:06,657 INFO L87 Difference]: Start difference. First operand 989 states and 1275 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:07,436 INFO L93 Difference]: Finished difference Result 1686 states and 2211 transitions. [2025-03-03 15:17:07,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:07,436 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:07,437 INFO L225 Difference]: With dead ends: 1686 [2025-03-03 15:17:07,437 INFO L226 Difference]: Without dead ends: 1511 [2025-03-03 15:17:07,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:07,438 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 3639 mSDsluCounter, 2900 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3639 SdHoareTripleChecker+Valid, 3629 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:07,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3639 Valid, 3629 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-03 15:17:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 989. [2025-03-03 15:17:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3164426059979317) internal successors, (1273), 988 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1273 transitions. [2025-03-03 15:17:07,445 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1273 transitions. Word has length 101 [2025-03-03 15:17:07,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:07,445 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1273 transitions. [2025-03-03 15:17:07,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:07,445 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1273 transitions. [2025-03-03 15:17:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:07,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:07,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] [2025-03-03 15:17:07,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-03 15:17:07,446 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash 968732578, now seen corresponding path program 1 times [2025-03-03 15:17:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971330522] [2025-03-03 15:17:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:07,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:07,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:07,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:07,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:07,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:07,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971330522] [2025-03-03 15:17:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971330522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954563050] [2025-03-03 15:17:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:07,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:07,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:07,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:07,621 INFO L87 Difference]: Start difference. First operand 989 states and 1273 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:08,258 INFO L93 Difference]: Finished difference Result 1611 states and 2097 transitions. [2025-03-03 15:17:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:08,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:08,260 INFO L225 Difference]: With dead ends: 1611 [2025-03-03 15:17:08,260 INFO L226 Difference]: Without dead ends: 1453 [2025-03-03 15:17:08,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:08,261 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 3017 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3017 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:08,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3017 Valid, 2792 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-03-03 15:17:08,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 989. [2025-03-03 15:17:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 967 states have (on average 1.3143743536711479) internal successors, (1271), 988 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1271 transitions. [2025-03-03 15:17:08,267 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1271 transitions. Word has length 101 [2025-03-03 15:17:08,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:08,267 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1271 transitions. [2025-03-03 15:17:08,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:08,267 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1271 transitions. [2025-03-03 15:17:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:08,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:08,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:08,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-03 15:17:08,268 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1212771758, now seen corresponding path program 1 times [2025-03-03 15:17:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910035698] [2025-03-03 15:17:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:08,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:08,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:08,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910035698] [2025-03-03 15:17:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910035698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:08,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:08,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724357181] [2025-03-03 15:17:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:08,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:08,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:08,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:08,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:08,548 INFO L87 Difference]: Start difference. First operand 989 states and 1271 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:09,738 INFO L93 Difference]: Finished difference Result 2138 states and 2867 transitions. [2025-03-03 15:17:09,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:09,739 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:09,740 INFO L225 Difference]: With dead ends: 2138 [2025-03-03 15:17:09,740 INFO L226 Difference]: Without dead ends: 1963 [2025-03-03 15:17:09,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:09,741 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 5153 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5153 SdHoareTripleChecker+Valid, 4197 SdHoareTripleChecker+Invalid, 3052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:09,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5153 Valid, 4197 Invalid, 3052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2025-03-03 15:17:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 999. [2025-03-03 15:17:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3111566018423746) internal successors, (1281), 998 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1281 transitions. [2025-03-03 15:17:09,749 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1281 transitions. Word has length 101 [2025-03-03 15:17:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1281 transitions. [2025-03-03 15:17:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1281 transitions. [2025-03-03 15:17:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:09,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:09,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:09,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-03 15:17:09,751 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:09,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1063663506, now seen corresponding path program 1 times [2025-03-03 15:17:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489265130] [2025-03-03 15:17:09,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:09,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:09,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:09,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489265130] [2025-03-03 15:17:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489265130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:09,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:09,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:09,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913859028] [2025-03-03 15:17:09,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:09,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:09,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:09,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:09,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:09,925 INFO L87 Difference]: Start difference. First operand 999 states and 1281 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:10,596 INFO L93 Difference]: Finished difference Result 1621 states and 2105 transitions. [2025-03-03 15:17:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:10,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:10,597 INFO L225 Difference]: With dead ends: 1621 [2025-03-03 15:17:10,597 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:10,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:10,598 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 3985 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3985 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:10,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3985 Valid, 2719 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 999. [2025-03-03 15:17:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3091095189355169) internal successors, (1279), 998 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1279 transitions. [2025-03-03 15:17:10,605 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1279 transitions. Word has length 101 [2025-03-03 15:17:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:10,605 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1279 transitions. [2025-03-03 15:17:10,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1279 transitions. [2025-03-03 15:17:10,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:10,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:10,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:10,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-03 15:17:10,606 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:10,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 589383042, now seen corresponding path program 1 times [2025-03-03 15:17:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378876105] [2025-03-03 15:17:10,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:10,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:10,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:10,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:10,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378876105] [2025-03-03 15:17:10,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378876105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:10,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:10,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:10,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735804373] [2025-03-03 15:17:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:10,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:10,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:10,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:10,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:10,776 INFO L87 Difference]: Start difference. First operand 999 states and 1279 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:11,407 INFO L93 Difference]: Finished difference Result 1621 states and 2103 transitions. [2025-03-03 15:17:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:11,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:11,409 INFO L225 Difference]: With dead ends: 1621 [2025-03-03 15:17:11,409 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:11,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:11,409 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 3701 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3701 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:11,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3701 Valid, 2726 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 999. [2025-03-03 15:17:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3070624360286591) internal successors, (1277), 998 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1277 transitions. [2025-03-03 15:17:11,416 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1277 transitions. Word has length 101 [2025-03-03 15:17:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:11,416 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1277 transitions. [2025-03-03 15:17:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1277 transitions. [2025-03-03 15:17:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:11,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:11,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:11,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-03 15:17:11,417 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1730680062, now seen corresponding path program 1 times [2025-03-03 15:17:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516297320] [2025-03-03 15:17:11,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:11,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:11,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:11,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:11,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:11,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:11,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516297320] [2025-03-03 15:17:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516297320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503040114] [2025-03-03 15:17:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:11,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:11,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:11,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:11,584 INFO L87 Difference]: Start difference. First operand 999 states and 1277 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:12,262 INFO L93 Difference]: Finished difference Result 1530 states and 1966 transitions. [2025-03-03 15:17:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:12,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:12,264 INFO L225 Difference]: With dead ends: 1530 [2025-03-03 15:17:12,264 INFO L226 Difference]: Without dead ends: 1511 [2025-03-03 15:17:12,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:12,265 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2706 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 2086 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2706 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:12,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2706 Valid, 3183 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:12,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-03 15:17:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 999. [2025-03-03 15:17:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3050153531218014) internal successors, (1275), 998 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1275 transitions. [2025-03-03 15:17:12,271 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1275 transitions. Word has length 101 [2025-03-03 15:17:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:12,271 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1275 transitions. [2025-03-03 15:17:12,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1275 transitions. [2025-03-03 15:17:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:12,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:12,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:12,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-03 15:17:12,272 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:12,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:12,272 INFO L85 PathProgramCache]: Analyzing trace with hash 545755202, now seen corresponding path program 1 times [2025-03-03 15:17:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:12,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796084570] [2025-03-03 15:17:12,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:12,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:12,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:12,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:12,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:12,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:12,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796084570] [2025-03-03 15:17:12,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796084570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:12,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:12,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:12,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418352240] [2025-03-03 15:17:12,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:12,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:12,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:12,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:12,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:12,442 INFO L87 Difference]: Start difference. First operand 999 states and 1275 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:13,097 INFO L93 Difference]: Finished difference Result 1469 states and 1871 transitions. [2025-03-03 15:17:13,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:13,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:13,098 INFO L225 Difference]: With dead ends: 1469 [2025-03-03 15:17:13,098 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:13,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:13,099 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 3913 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3913 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:13,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3913 Valid, 2774 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 999. [2025-03-03 15:17:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 977 states have (on average 1.3029682702149437) internal successors, (1273), 998 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1273 transitions. [2025-03-03 15:17:13,105 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1273 transitions. Word has length 101 [2025-03-03 15:17:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:13,105 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1273 transitions. [2025-03-03 15:17:13,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1273 transitions. [2025-03-03 15:17:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:13,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:13,106 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:13,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-03 15:17:13,106 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -551655950, now seen corresponding path program 1 times [2025-03-03 15:17:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135529138] [2025-03-03 15:17:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:13,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:13,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:13,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135529138] [2025-03-03 15:17:13,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135529138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:13,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:13,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820168162] [2025-03-03 15:17:13,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:13,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:13,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:13,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:13,368 INFO L87 Difference]: Start difference. First operand 999 states and 1273 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:14,454 INFO L93 Difference]: Finished difference Result 1841 states and 2409 transitions. [2025-03-03 15:17:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:14,457 INFO L225 Difference]: With dead ends: 1841 [2025-03-03 15:17:14,457 INFO L226 Difference]: Without dead ends: 1835 [2025-03-03 15:17:14,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:14,457 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 6505 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6505 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:14,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6505 Valid, 3558 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2513 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-03 15:17:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1009. [2025-03-03 15:17:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 987 states have (on average 1.2998986828774062) internal successors, (1283), 1008 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1283 transitions. [2025-03-03 15:17:14,465 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1283 transitions. Word has length 101 [2025-03-03 15:17:14,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:14,465 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1283 transitions. [2025-03-03 15:17:14,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1283 transitions. [2025-03-03 15:17:14,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:14,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:14,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:14,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-03 15:17:14,466 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:14,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:14,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1442026434, now seen corresponding path program 1 times [2025-03-03 15:17:14,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010178266] [2025-03-03 15:17:14,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:14,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010178266] [2025-03-03 15:17:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010178266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536432402] [2025-03-03 15:17:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:14,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:14,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:14,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:14,740 INFO L87 Difference]: Start difference. First operand 1009 states and 1283 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:15,811 INFO L93 Difference]: Finished difference Result 1841 states and 2407 transitions. [2025-03-03 15:17:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:15,814 INFO L225 Difference]: With dead ends: 1841 [2025-03-03 15:17:15,814 INFO L226 Difference]: Without dead ends: 1835 [2025-03-03 15:17:15,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:15,814 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 6568 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6568 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:15,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6568 Valid, 3307 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-03 15:17:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1019. [2025-03-03 15:17:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 997 states have (on average 1.2968906720160482) internal successors, (1293), 1018 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1293 transitions. [2025-03-03 15:17:15,823 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1293 transitions. Word has length 101 [2025-03-03 15:17:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1293 transitions. [2025-03-03 15:17:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1293 transitions. [2025-03-03 15:17:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:15,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:15,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:15,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-03 15:17:15,824 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:15,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1547737554, now seen corresponding path program 1 times [2025-03-03 15:17:15,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:15,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084251260] [2025-03-03 15:17:15,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:15,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:15,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:15,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:16,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-03-03 15:17:16,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:16,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084251260] [2025-03-03 15:17:16,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084251260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:16,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:17:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633980283] [2025-03-03 15:17:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:16,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:17:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:16,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:17:16,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:17:16,109 INFO L87 Difference]: Start difference. First operand 1019 states and 1293 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:17,106 INFO L93 Difference]: Finished difference Result 1989 states and 2626 transitions. [2025-03-03 15:17:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:17:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:17,108 INFO L225 Difference]: With dead ends: 1989 [2025-03-03 15:17:17,108 INFO L226 Difference]: Without dead ends: 1835 [2025-03-03 15:17:17,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:17:17,109 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 6635 mSDsluCounter, 2241 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6635 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 2230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:17,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6635 Valid, 2899 Invalid, 2230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 15:17:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-03-03 15:17:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1024. [2025-03-03 15:17:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1002 states have (on average 1.2954091816367266) internal successors, (1298), 1023 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1298 transitions. [2025-03-03 15:17:17,116 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1298 transitions. Word has length 101 [2025-03-03 15:17:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1298 transitions. [2025-03-03 15:17:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1298 transitions. [2025-03-03 15:17:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:17,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:17,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:17,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-03 15:17:17,117 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:17,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 504290542, now seen corresponding path program 1 times [2025-03-03 15:17:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7365107] [2025-03-03 15:17:17,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:17,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:17,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:17,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:17,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:17,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:17,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7365107] [2025-03-03 15:17:17,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7365107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:17,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:17,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528478541] [2025-03-03 15:17:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:17,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:17,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:17,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:17,279 INFO L87 Difference]: Start difference. First operand 1024 states and 1298 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:17,878 INFO L93 Difference]: Finished difference Result 1617 states and 2085 transitions. [2025-03-03 15:17:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:17,880 INFO L225 Difference]: With dead ends: 1617 [2025-03-03 15:17:17,880 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:17,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:17,880 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 3776 mSDsluCounter, 1913 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3776 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:17,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3776 Valid, 2527 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:17,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1024. [2025-03-03 15:17:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1002 states have (on average 1.2944111776447105) internal successors, (1297), 1023 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1297 transitions. [2025-03-03 15:17:17,887 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1297 transitions. Word has length 101 [2025-03-03 15:17:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:17,887 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1297 transitions. [2025-03-03 15:17:17,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1297 transitions. [2025-03-03 15:17:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:17,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:17,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] [2025-03-03 15:17:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-03 15:17:17,888 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:17,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:17,888 INFO L85 PathProgramCache]: Analyzing trace with hash -277743716, now seen corresponding path program 1 times [2025-03-03 15:17:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:17,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005225465] [2025-03-03 15:17:17,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:17,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:17,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:17,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:17,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:18,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:18,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005225465] [2025-03-03 15:17:18,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005225465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:18,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:18,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:18,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430281073] [2025-03-03 15:17:18,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:18,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:18,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:18,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:18,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:18,051 INFO L87 Difference]: Start difference. First operand 1024 states and 1297 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:18,725 INFO L93 Difference]: Finished difference Result 1718 states and 2218 transitions. [2025-03-03 15:17:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:18,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:18,726 INFO L225 Difference]: With dead ends: 1718 [2025-03-03 15:17:18,726 INFO L226 Difference]: Without dead ends: 1551 [2025-03-03 15:17:18,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:18,727 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 1862 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1862 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:18,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1862 Valid, 3183 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:17:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2025-03-03 15:17:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1024. [2025-03-03 15:17:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1002 states have (on average 1.2934131736526946) internal successors, (1296), 1023 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1296 transitions. [2025-03-03 15:17:18,744 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1296 transitions. Word has length 101 [2025-03-03 15:17:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:18,744 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1296 transitions. [2025-03-03 15:17:18,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1296 transitions. [2025-03-03 15:17:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:18,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:18,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:18,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-03 15:17:18,745 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:18,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 973863934, now seen corresponding path program 1 times [2025-03-03 15:17:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:18,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979242053] [2025-03-03 15:17:18,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:18,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:18,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:18,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:18,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:18,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:18,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979242053] [2025-03-03 15:17:18,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979242053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:18,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:18,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:18,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271855532] [2025-03-03 15:17:18,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:18,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:18,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:18,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:18,930 INFO L87 Difference]: Start difference. First operand 1024 states and 1296 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:19,550 INFO L93 Difference]: Finished difference Result 1617 states and 2082 transitions. [2025-03-03 15:17:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:19,552 INFO L225 Difference]: With dead ends: 1617 [2025-03-03 15:17:19,552 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:19,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:19,553 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 4163 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4163 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:19,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4163 Valid, 2595 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1024. [2025-03-03 15:17:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1002 states have (on average 1.2924151696606787) internal successors, (1295), 1023 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1295 transitions. [2025-03-03 15:17:19,559 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1295 transitions. Word has length 101 [2025-03-03 15:17:19,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:19,559 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1295 transitions. [2025-03-03 15:17:19,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1295 transitions. [2025-03-03 15:17:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:19,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:19,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:19,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-03 15:17:19,560 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:19,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1710146206, now seen corresponding path program 1 times [2025-03-03 15:17:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364189107] [2025-03-03 15:17:19,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:19,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:19,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:19,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:19,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364189107] [2025-03-03 15:17:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364189107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:19,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657971947] [2025-03-03 15:17:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:19,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:19,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:19,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:19,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:19,720 INFO L87 Difference]: Start difference. First operand 1024 states and 1295 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:20,327 INFO L93 Difference]: Finished difference Result 1469 states and 1860 transitions. [2025-03-03 15:17:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:20,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:17:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:20,329 INFO L225 Difference]: With dead ends: 1469 [2025-03-03 15:17:20,329 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 15:17:20,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:20,329 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 3095 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3095 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:20,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3095 Valid, 2580 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 15:17:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1024. [2025-03-03 15:17:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1002 states have (on average 1.2914171656686626) internal successors, (1294), 1023 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1294 transitions. [2025-03-03 15:17:20,336 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1294 transitions. Word has length 101 [2025-03-03 15:17:20,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:20,336 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1294 transitions. [2025-03-03 15:17:20,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1294 transitions. [2025-03-03 15:17:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:20,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:20,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:20,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-03 15:17:20,337 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2025-03-03 15:17:20,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:20,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1153130487, now seen corresponding path program 1 times [2025-03-03 15:17:20,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:20,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513156626] [2025-03-03 15:17:20,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:20,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:20,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:20,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:20,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:20,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513156626] [2025-03-03 15:17:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513156626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390756011] [2025-03-03 15:17:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:20,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:20,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:20,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:20,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:20,497 INFO L87 Difference]: Start difference. First operand 1024 states and 1294 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)