./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-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 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:17:24,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:17:24,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:17:24,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:17:24,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:17:24,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:17:24,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:17:24,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:17:24,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:17:24,290 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:17:24,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:17:24,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:17:24,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:17:24,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:17:24,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:17:24,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:24,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:17:24,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:17:24,292 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 -> 6c698c3a474f0bb431ef6e81ac39d288198716f9950dc2b1ea90a04cccf08b06 [2025-03-03 15:17:24,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:17:24,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:17:24,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:17:24,530 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:17:24,530 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:17:24,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-03 15:17:25,669 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22ac06a7/486adfbeb4f24e07986c7d1f073d2996/FLAGe1c48e4f9 [2025-03-03 15:17:26,138 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:17:26,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-03 15:17:26,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22ac06a7/486adfbeb4f24e07986c7d1f073d2996/FLAGe1c48e4f9 [2025-03-03 15:17:26,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e22ac06a7/486adfbeb4f24e07986c7d1f073d2996 [2025-03-03 15:17:26,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:17:26,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:17:26,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:26,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:17:26,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:17:26,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:26" (1/1) ... [2025-03-03 15:17:26,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:26, skipping insertion in model container [2025-03-03 15:17:26,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:17:26" (1/1) ... [2025-03-03 15:17:26,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:17:26,706 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2025-03-03 15:17:26,723 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2025-03-03 15:17:26,728 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2025-03-03 15:17:26,732 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2025-03-03 15:17:26,738 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2025-03-03 15:17:26,741 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2025-03-03 15:17:26,746 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2025-03-03 15:17:26,759 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2025-03-03 15:17:26,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2025-03-03 15:17:26,767 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2025-03-03 15:17:26,776 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2025-03-03 15:17:26,794 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2025-03-03 15:17:26,797 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2025-03-03 15:17:26,800 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2025-03-03 15:17:26,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2025-03-03 15:17:26,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2025-03-03 15:17:26,833 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2025-03-03 15:17:26,836 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2025-03-03 15:17:26,839 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2025-03-03 15:17:26,845 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2025-03-03 15:17:26,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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2025-03-03 15:17:26,873 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2025-03-03 15:17:26,901 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2025-03-03 15:17:26,904 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2025-03-03 15:17:26,907 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2025-03-03 15:17:26,913 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2025-03-03 15:17:26,922 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2025-03-03 15:17:26,935 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2025-03-03 15:17:26,970 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2025-03-03 15:17:27,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:27,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:17:27,391 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17604,17617] [2025-03-03 15:17:27,398 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22921,22934] [2025-03-03 15:17:27,402 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24278,24291] [2025-03-03 15:17:27,404 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25086,25099] [2025-03-03 15:17:27,410 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26814,26827] [2025-03-03 15:17:27,412 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27622,27635] [2025-03-03 15:17:27,415 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28801,28814] [2025-03-03 15:17:27,420 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31541,31554] [2025-03-03 15:17:27,423 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32352,32365] [2025-03-03 15:17:27,426 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33534,33547] [2025-03-03 15:17:27,430 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35725,35738] [2025-03-03 15:17:27,437 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2025-03-03 15:17:27,440 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40796,40809] [2025-03-03 15:17:27,442 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41978,41991] [2025-03-03 15:17:27,446 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44169,44182] [2025-03-03 15:17:27,453 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47880,47893] [2025-03-03 15:17:27,466 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54627,54640] [2025-03-03 15:17:27,469 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55438,55451] [2025-03-03 15:17:27,471 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56581,56594] [2025-03-03 15:17:27,476 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58733,58746] [2025-03-03 15:17:27,483 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62650,62663] [2025-03-03 15:17:27,496 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69599,69612] [2025-03-03 15:17:27,517 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2025-03-03 15:17:27,520 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83146,83159] [2025-03-03 15:17:27,523 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2025-03-03 15:17:27,527 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86519,86532] [2025-03-03 15:17:27,534 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90230,90243] [2025-03-03 15:17:27,545 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96428,96441] [2025-03-03 15:17:27,561 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.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[107019,107032] [2025-03-03 15:17:27,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:17:27,872 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:17:27,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27 WrapperNode [2025-03-03 15:17:27,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:17:27,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:27,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:17:27,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:17:27,879 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:17:27" (1/1) ... [2025-03-03 15:17:27,927 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:17:27" (1/1) ... [2025-03-03 15:17:28,093 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13514 [2025-03-03 15:17:28,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:17:28,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:17:28,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:17:28,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:17:28,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,269 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:17:28,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:17:28,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:17:28,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:17:28,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:17:28,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (1/1) ... [2025-03-03 15:17:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:17:28,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:17:28,446 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:17:28,453 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:17:28,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:17:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:17:28,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:17:28,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:17:28,779 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:17:28,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:17:33,224 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4462: havoc main_~node7__m7~25#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6576: havoc main_~node7__m7~42#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19789: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~179#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15297: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~132#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10805: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~85#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5784: havoc main_~check__tmp~47#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14241: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~121#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9749: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~74#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17677: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~157#1; [2025-03-03 15:17:33,225 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8429: havoc main_~node6__m6~31#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7372: havoc main_~node6__m6~26#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9222: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13979: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~91#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20057: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~182#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12658: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~check__tmp~25#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16094: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20851: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~127#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc main_~check__tmp~22#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4205: havoc main_~check__tmp~36#1; [2025-03-03 15:17:33,226 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: 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:17:33,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-03 15:17:33,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19533: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-03 15:17:33,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2357: havoc main_~check__tmp~16#1;havoc main_~node7__m7~9#1; [2025-03-03 15:17:33,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14777: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~127#1; [2025-03-03 15:17:33,227 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10285: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~80#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: havoc main_~node6__m6~3#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5529: havoc main_~node5__m5~10#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1037: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267: havoc main_~node6__m6~17#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2097: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11876: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15049: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~129#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8444: havoc main_~node7__m7~60#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7387: havoc main_~node7__m7~50#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18223: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~113#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9239: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~66#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12675: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~84#1; [2025-03-03 15:17:33,228 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16111: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~102#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10563: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~73#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6335: havoc main_~node6__m6~21#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16641: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~146#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12149: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~99#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L786: havoc main_~node2__m2~2#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15585: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~135#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17435: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~109#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580: havoc main_~node7__m7~4#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5544: havoc main_~node6__m6~18#1; [2025-03-03 15:17:33,229 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19021: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~171#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10037: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~77#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19550: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc main_~check__tmp~63#1;havoc main_~node7__m7~52#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5282: havoc main_~node7__m7~32#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12417: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~102#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13211: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~87#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19289: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~174#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11361: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~91#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13741: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~116#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17177: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~152#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc main_~node7__m7~19#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20613: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~188#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11893: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-03 15:17:33,230 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11629: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~94#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18765: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14538: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11105: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~node3__m3~2#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2651: havoc main_~node7__m7~11#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7144: havoc main_~node6__m6~25#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5559: havoc main_~node7__m7~34#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6616: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~55#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6090: havoc main_~node5__m5~11#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19567: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~120#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6884: havoc main_~node7__m7~45#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17983: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13493: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~113#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9001: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~66#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4773: havoc main_~check__tmp~41#1;havoc main_~node7__m7~27#1; [2025-03-03 15:17:33,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16929: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~149#1; [2025-03-03 15:17:33,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8209: havoc main_~node4__m4~9#1; [2025-03-03 15:17:33,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9795: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~69#1; [2025-03-03 15:17:33,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7945: havoc main_~node7__m7~55#1; [2025-03-03 15:17:33,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20365: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~185#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15873: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~138#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11910: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15346: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20103: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~123#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18782: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14555: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~94#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: havoc main_~check__tmp~13#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11122: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc main_~node4__m4~2#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14029: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~119#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9537: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~72#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7159: havoc main_~node7__m7~48#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12973: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~108#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20901: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_157~0#1, main_~assert__arg~156#1;havoc main_~check__tmp~191#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16409: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~144#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6105: havoc main_~node6__m6~20#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7427: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~60#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: havoc main_~node6__m6~19#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18000: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: havoc main_~node5__m5~3#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1353: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8224: havoc main_~node5__m5~16#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10340: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~check__tmp~34#1;havoc main_~node7__m7~21#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11927: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~80#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15363: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~98#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6379: havoc main_~check__tmp~54#1;havoc main_~node7__m7~40#1; [2025-03-03 15:17:33,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18799: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~116#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: havoc main_~node5__m5~2#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16687: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~105#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18273: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~163#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11139: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~76#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9289: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~69#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3740: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12725: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~105#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5062: havoc main_~node5__m5~9#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16161: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~141#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6120: havoc main_~node7__m7~38#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1628: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10613: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~83#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: havoc main_~check__tmp~26#1;havoc main_~node7__m7~15#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12463: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~83#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18541: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~166#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~node7__m7~36#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19335: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~119#1; [2025-03-03 15:17:33,234 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc main_~check__tmp~23#1;havoc main_~node7__m7~13#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17485: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~155#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19865: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~180#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4274: havoc main_~check__tmp~37#1;havoc main_~node7__m7~23#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node6__m6~4#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10881: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~86#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8767: havoc main_~node7__m7~64#1;havoc main_~node6__m6~33#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8239: havoc main_~node6__m6~30#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14317: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~122#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17753: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~158#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11675: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~79#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18017: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13261: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~111#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2691: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6655: havoc main_~check__tmp~56#1; [2025-03-03 15:17:33,236 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13790: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-03 15:17:33,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20662: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-03 15:17:33,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10357: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-03 15:17:33,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17229: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-03 15:17:33,237 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8509: havoc main_~node7__m7~61#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node6__m6~2#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14853: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~128#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5077: havoc main_~node6__m6~16#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5607: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~44#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc main_~node7__m7~53#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3495: havoc main_~node3__m3~3#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: havoc main_~node7__m7~6#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5347: havoc main_~node7__m7~33#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19617: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~177#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15125: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~130#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9047: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~65#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15919: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~101#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18034: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13807: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~90#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: havoc main_~check__tmp~61#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20679: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~126#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9845: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~75#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10374: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20153: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~183#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12225: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~100#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17246: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15661: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~136#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19097: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~172#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14605: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~125#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L864: havoc main_~node7__m7~2#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10113: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~78#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7208: havoc main_~node7__m7~49#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13022: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11437: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~92#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: havoc main_~node4__m4~4#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9589: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3778: havoc main_~check__tmp~31#1; [2025-03-03 15:17:33,238 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1401: havoc main_~node7__m7~3#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194: havoc main_~node6__m6~5#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16464: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18051: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~112#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: havoc main_~node4__m4~3#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6160: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~51#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5897: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~48#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10391: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~72#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11977: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~97#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6428: havoc main_~node7__m7~41#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15413: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~133#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L615: 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:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17263: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~108#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18849: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~169#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: havoc main_~check__tmp~20#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: havoc main_~node4__m4~5#1; [2025-03-03 15:17:33,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16737: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~147#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18587: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~115#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525: havoc main_~node5__m5~6#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11189: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~89#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13039: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~86#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8283: havoc main_~check__tmp~65#1;havoc main_~node7__m7~58#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13569: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~114#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10927: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~75#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17005: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~150#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9606: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14363: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~93#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20441: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~186#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12513: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~103#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17799: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~111#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19385: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~175#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19914: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2209: havoc main_~node7__m7~8#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2475: havoc main_~node5__m5~4#1; [2025-03-03 15:17:33,241 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16481: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4854: havoc main_~node6__m6~15#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1683: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11725: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~95#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6969: havoc main_~node5__m5~13#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14105: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~120#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5121: havoc main_~check__tmp~43#1;havoc main_~node7__m7~30#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8028: havoc main_~node6__m6~29#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20977: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_158~0#1, main_~assert__arg~157#1;havoc main_~check__tmp~192#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2__m2~1#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4596: havoc main_~node5__m5~8#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3540: havoc main_~node6__m6~10#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15171: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~97#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1959: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9623: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~68#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3281: havoc main_~node6__m6~9#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~node6__m6~6#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19931: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~122#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9097: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~67#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~45#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6984: havoc main_~node6__m6~24#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15969: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~139#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16498: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8043: havoc main_~node7__m7~56#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14914: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18349: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~164#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13857: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~117#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9365: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~70#1; [2025-03-03 15:17:33,242 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20729: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~189#1; [2025-03-03 15:17:33,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12801: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~106#1; [2025-03-03 15:17:33,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16237: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~142#1; [2025-03-03 15:17:33,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10159: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~71#1; [2025-03-03 15:17:33,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~node3__m3~1#1; [2025-03-03 15:17:33,244 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724: havoc main_~check__tmp~57#1;havoc main_~node7__m7~43#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12274: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4611: havoc main_~node6__m6~14#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10689: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~84#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19146: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: havoc main_~node7__m7~18#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17561: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~156#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: havoc main_~check__tmp~52#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15713: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-03 15:17:33,245 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5936: havoc main_~check__tmp~49#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11486: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13337: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~112#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505: havoc main_~node7__m7~10#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4355: havoc main_~node6__m6~13#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1449: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: havoc main_~node5__m5~5#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16515: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~104#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18101: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~161#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14931: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node4__m4~1#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4097: havoc main_~node5__m5~7#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4626: havoc main_~node7__m7~26#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc main_~check__tmp~62#1;havoc main_~node7__m7~51#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12291: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~82#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10441: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~81#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: 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:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8592: havoc main_~node5__m5~17#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3836: havoc main_~node6__m6~11#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17313: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~153#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19163: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~118#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13615: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~89#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19693: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~178#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15730: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17051: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~107#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20487: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~125#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18637: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~167#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11503: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~78#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726: havoc main_~node7__m7~5#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13089: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~109#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4898: havoc main_~check__tmp~42#1;havoc main_~node7__m7~28#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10977: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~87#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14413: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~123#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17849: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~159#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9921: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~76#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3051: havoc main_~node6__m6~8#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20229: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~184#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: havoc main_~node6__m6~7#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14681: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~126#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc main_~node5__m5~1#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4112: havoc main_~node6__m6~12#1; [2025-03-03 15:17:33,246 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14948: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-03 15:17:33,247 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8607: havoc main_~node6__m6~32#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14157: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3851: havoc main_~node7__m7~20#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8346: havoc main_~node7__m7~59#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~check__tmp~27#1;havoc main_~node7__m7~16#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15747: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~100#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~node7__m7~35#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7028: havoc main_~check__tmp~59#1;havoc main_~node7__m7~46#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15221: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~131#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066: havoc main_~node7__m7~14#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7823: havoc main_~node5__m5~15#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9673: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~73#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2803: havoc main_~node7__m7~12#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12053: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~98#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9411: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~67#1; [2025-03-03 15:17:33,248 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19981: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~181#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15489: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~134#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node6__m6~1#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12847: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~85#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18925: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~170#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16283: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~103#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4127: havoc main_~node7__m7~22#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5184: havoc main_~node7__m7~31#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2014: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18398: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16813: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~148#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8622: havoc main_~node7__m7~62#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11265: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~90#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14965: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10209: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~79#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10738: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3603: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14174: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12589: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~104#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17610: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19461: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~176#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc main_~check__tmp~38#1;havoc main_~node7__m7~24#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4666: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~39#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11801: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~96#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc main_~check__tmp~15#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7838: havoc main_~node6__m6~28#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2553: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node7__m7~1#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13392: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8108: havoc main_~node7__m7~57#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1766: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16565: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~145#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18415: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~114#1; [2025-03-03 15:17:33,249 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1504: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:17:33,253 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14982: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19739: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~121#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6791: havoc main_~node6__m6~23#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10755: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~74#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12341: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~101#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14191: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~92#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17627: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~110#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19213: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~173#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13665: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~115#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9173: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~68#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17101: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~151#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: havoc main_~node4__m4~7#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20537: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~187#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16045: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~140#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11553: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~93#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6268: havoc main_~check__tmp~53#1;havoc main_~node7__m7~39#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6005: havoc main_~check__tmp~50#1;havoc main_~node7__m7~37#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3891: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~32#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13933: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~118#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7327: havoc main_~node3__m3~5#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9970: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20805: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~190#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14727: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~95#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5745: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~46#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13409: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20281: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~node2__m2~3#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3106: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2843: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14999: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~96#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374: havoc main_~node7__m7~17#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4167: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~35#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6546: havoc main_~node5__m5~12#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4961: havoc main_~node7__m7~29#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15797: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~137#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7077: havoc main_~node7__m7~47#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7342: havoc main_~node4__m4~8#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057: havoc main_~node7__m7~7#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12099: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~81#1; [2025-03-03 15:17:33,254 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18177: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~162#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L15535: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~99#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18971: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~117#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9987: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~70#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L10517: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~82#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4704: havoc main_~check__tmp~40#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9461: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~71#1; [2025-03-03 15:17:33,255 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11311: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~77#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17389: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~154#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12897: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~107#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13426: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16333: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~143#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5499: havoc main_~node3__m3~4#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16862: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20298: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18713: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~168#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7615: havoc main_~node6__m6~27#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13165: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~110#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11053: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~88#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7882: havoc main_~check__tmp~64#1;havoc main_~node7__m7~54#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6561: havoc main_~node6__m6~22#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L14489: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~124#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~check__tmp~9#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17925: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~160#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L12641: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7357: havoc main_~node5__m5~14#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3658: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19516: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6835: havoc main_~check__tmp~58#1;havoc main_~node7__m7~44#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5514: havoc main_~node4__m4~6#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3929: havoc main_~check__tmp~33#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13443: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~88#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L16879: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~106#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8687: havoc main_~node7__m7~63#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18465: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~165#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L11859: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-03 15:17:33,256 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L20315: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~124#1; [2025-03-03 15:17:33,659 INFO L? ?]: Removed 2124 outVars from TransFormulas that were not future-live. [2025-03-03 15:17:33,660 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:17:33,698 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:17:33,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:17:33,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:33 BoogieIcfgContainer [2025-03-03 15:17:33,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:17:33,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:17:33,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:17:33,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:17:33,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:17:26" (1/3) ... [2025-03-03 15:17:33,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427947a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:33, skipping insertion in model container [2025-03-03 15:17:33,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:17:27" (2/3) ... [2025-03-03 15:17:33,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3427947a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:17:33, skipping insertion in model container [2025-03-03 15:17:33,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:17:33" (3/3) ... [2025-03-03 15:17:33,710 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-03 15:17:33,719 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:17:33,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c that has 1 procedures, 2082 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-03 15:17:33,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:17:33,809 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;@4ec5713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:17:33,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-03 15:17:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:17:33,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:33,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:33,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:33,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -379247245, now seen corresponding path program 1 times [2025-03-03 15:17:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:33,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456292105] [2025-03-03 15:17:33,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:33,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:17:34,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:17:34,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:34,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:34,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:17:34,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456292105] [2025-03-03 15:17:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456292105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:34,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:34,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291320709] [2025-03-03 15:17:34,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:34,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:34,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:34,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:34,437 INFO L87 Difference]: Start difference. First operand has 2082 states, 2052 states have (on average 1.8606237816764133) internal successors, (3818), 2081 states have internal predecessors, (3818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:35,571 INFO L93 Difference]: Finished difference Result 3095 states and 5492 transitions. [2025-03-03 15:17:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:35,595 INFO L225 Difference]: With dead ends: 3095 [2025-03-03 15:17:35,596 INFO L226 Difference]: Without dead ends: 1591 [2025-03-03 15:17:35,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:35,604 INFO L435 NwaCegarLoop]: 1854 mSDtfsCounter, 8280 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8280 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:35,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8280 Valid, 1916 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-03-03 15:17:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1591. [2025-03-03 15:17:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1562 states have (on average 1.32202304737516) internal successors, (2065), 1590 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2065 transitions. [2025-03-03 15:17:35,708 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2065 transitions. Word has length 101 [2025-03-03 15:17:35,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:35,708 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2065 transitions. [2025-03-03 15:17:35,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 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:35,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2065 transitions. [2025-03-03 15:17:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 15:17:35,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:35,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:35,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:17:35,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:35,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1480014339, now seen corresponding path program 1 times [2025-03-03 15:17:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315121405] [2025-03-03 15:17:35,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:35,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:35,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 15:17:35,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 15:17:35,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:35,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315121405] [2025-03-03 15:17:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315121405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627878365] [2025-03-03 15:17:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:35,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:35,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:35,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:35,948 INFO L87 Difference]: Start difference. First operand 1591 states and 2065 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:36,903 INFO L93 Difference]: Finished difference Result 3181 states and 4290 transitions. [2025-03-03 15:17:36,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-03-03 15:17:36,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:36,909 INFO L225 Difference]: With dead ends: 3181 [2025-03-03 15:17:36,909 INFO L226 Difference]: Without dead ends: 1912 [2025-03-03 15:17:36,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:36,911 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 6854 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6854 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:36,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6854 Valid, 1469 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-03-03 15:17:36,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1810. [2025-03-03 15:17:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1781 states have (on average 1.4003368893879842) internal successors, (2494), 1809 states have internal predecessors, (2494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2494 transitions. [2025-03-03 15:17:36,943 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2494 transitions. Word has length 102 [2025-03-03 15:17:36,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:36,943 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2494 transitions. [2025-03-03 15:17:36,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2494 transitions. [2025-03-03 15:17:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:17:36,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:36,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:36,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:17:36,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1546199995, now seen corresponding path program 1 times [2025-03-03 15:17:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101753244] [2025-03-03 15:17:36,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:36,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:17:37,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:17:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:37,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101753244] [2025-03-03 15:17:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101753244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336428461] [2025-03-03 15:17:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:37,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:37,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:37,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:37,141 INFO L87 Difference]: Start difference. First operand 1810 states and 2494 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:37,739 INFO L93 Difference]: Finished difference Result 3298 states and 4635 transitions. [2025-03-03 15:17:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:37,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 15:17:37,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:37,745 INFO L225 Difference]: With dead ends: 3298 [2025-03-03 15:17:37,746 INFO L226 Difference]: Without dead ends: 1679 [2025-03-03 15:17:37,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:37,750 INFO L435 NwaCegarLoop]: 915 mSDtfsCounter, 4783 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4783 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:37,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4783 Valid, 927 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-03-03 15:17:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2025-03-03 15:17:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1650 states have (on average 1.4212121212121211) internal successors, (2345), 1678 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2345 transitions. [2025-03-03 15:17:37,781 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2345 transitions. Word has length 103 [2025-03-03 15:17:37,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:37,782 INFO L471 AbstractCegarLoop]: Abstraction has 1679 states and 2345 transitions. [2025-03-03 15:17:37,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2345 transitions. [2025-03-03 15:17:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:17:37,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:37,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:37,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:17:37,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2137488699, now seen corresponding path program 1 times [2025-03-03 15:17:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166592720] [2025-03-03 15:17:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:37,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:17:37,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:17:37,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:37,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:37,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:37,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166592720] [2025-03-03 15:17:37,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166592720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:37,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:37,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:37,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640470946] [2025-03-03 15:17:37,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:37,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:37,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:37,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:37,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:37,950 INFO L87 Difference]: Start difference. First operand 1679 states and 2345 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:38,699 INFO L93 Difference]: Finished difference Result 3167 states and 4484 transitions. [2025-03-03 15:17:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 15:17:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:38,704 INFO L225 Difference]: With dead ends: 3167 [2025-03-03 15:17:38,704 INFO L226 Difference]: Without dead ends: 1639 [2025-03-03 15:17:38,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:38,706 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 4523 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4523 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4523 Valid, 713 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2025-03-03 15:17:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2025-03-03 15:17:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1610 states have (on average 1.4254658385093169) internal successors, (2295), 1638 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2295 transitions. [2025-03-03 15:17:38,737 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2295 transitions. Word has length 104 [2025-03-03 15:17:38,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:38,737 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2295 transitions. [2025-03-03 15:17:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2295 transitions. [2025-03-03 15:17:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:17:38,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:38,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:38,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:17:38,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1022695171, now seen corresponding path program 1 times [2025-03-03 15:17:38,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:38,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429410949] [2025-03-03 15:17:38,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:38,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:38,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:17:38,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:17:38,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:38,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429410949] [2025-03-03 15:17:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429410949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:38,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:38,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:38,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27182745] [2025-03-03 15:17:38,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:38,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:38,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:38,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:38,896 INFO L87 Difference]: Start difference. First operand 1639 states and 2295 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:39,450 INFO L93 Difference]: Finished difference Result 3127 states and 4432 transitions. [2025-03-03 15:17:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:39,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:17:39,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:39,455 INFO L225 Difference]: With dead ends: 3127 [2025-03-03 15:17:39,455 INFO L226 Difference]: Without dead ends: 1607 [2025-03-03 15:17:39,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:39,457 INFO L435 NwaCegarLoop]: 760 mSDtfsCounter, 4453 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:39,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 804 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:39,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-03-03 15:17:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2025-03-03 15:17:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1578 states have (on average 1.4302915082382763) internal successors, (2257), 1606 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2257 transitions. [2025-03-03 15:17:39,477 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2257 transitions. Word has length 105 [2025-03-03 15:17:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:39,477 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2257 transitions. [2025-03-03 15:17:39,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2257 transitions. [2025-03-03 15:17:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:17:39,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:39,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:17:39,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1380547917, now seen corresponding path program 1 times [2025-03-03 15:17:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833446622] [2025-03-03 15:17:39,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:39,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:39,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:17:39,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:17:39,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:39,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833446622] [2025-03-03 15:17:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833446622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:39,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:39,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690586115] [2025-03-03 15:17:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:39,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:39,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:39,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:39,605 INFO L87 Difference]: Start difference. First operand 1607 states and 2257 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:40,331 INFO L93 Difference]: Finished difference Result 3095 states and 4392 transitions. [2025-03-03 15:17:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:17:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:40,335 INFO L225 Difference]: With dead ends: 3095 [2025-03-03 15:17:40,335 INFO L226 Difference]: Without dead ends: 1579 [2025-03-03 15:17:40,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:40,337 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 4419 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:40,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 849 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:17:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-03-03 15:17:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2025-03-03 15:17:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1550 states have (on average 1.435483870967742) internal successors, (2225), 1578 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2225 transitions. [2025-03-03 15:17:40,357 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2225 transitions. Word has length 106 [2025-03-03 15:17:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:40,357 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2225 transitions. [2025-03-03 15:17:40,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2225 transitions. [2025-03-03 15:17:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:17:40,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:40,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:40,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:17:40,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:40,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1179250699, now seen corresponding path program 1 times [2025-03-03 15:17:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:40,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514783342] [2025-03-03 15:17:40,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:40,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:40,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:17:40,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:17:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514783342] [2025-03-03 15:17:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514783342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:17:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952063055] [2025-03-03 15:17:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:40,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:17:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:40,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:17:40,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:17:40,490 INFO L87 Difference]: Start difference. First operand 1579 states and 2225 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:41,035 INFO L93 Difference]: Finished difference Result 3067 states and 4358 transitions. [2025-03-03 15:17:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:17:41,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:17:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:41,039 INFO L225 Difference]: With dead ends: 3067 [2025-03-03 15:17:41,039 INFO L226 Difference]: Without dead ends: 1568 [2025-03-03 15:17:41,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:17:41,041 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 4346 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4346 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:41,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4346 Valid, 822 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:17:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-03 15:17:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2025-03-03 15:17:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4366471734892787) internal successors, (2211), 1567 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2211 transitions. [2025-03-03 15:17:41,062 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2211 transitions. Word has length 107 [2025-03-03 15:17:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:41,062 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2211 transitions. [2025-03-03 15:17:41,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2211 transitions. [2025-03-03 15:17:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:17:41,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:41,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:41,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:17:41,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:41,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2108950507, now seen corresponding path program 1 times [2025-03-03 15:17:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:41,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399830883] [2025-03-03 15:17:41,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:17:41,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:17:41,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:41,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:41,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:41,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399830883] [2025-03-03 15:17:41,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399830883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:41,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:41,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:17:41,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607962762] [2025-03-03 15:17:41,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:41,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:17:41,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:41,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:17:41,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:17:41,456 INFO L87 Difference]: Start difference. First operand 1568 states and 2211 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:42,705 INFO L93 Difference]: Finished difference Result 2720 states and 3700 transitions. [2025-03-03 15:17:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:17:42,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:17:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:42,710 INFO L225 Difference]: With dead ends: 2720 [2025-03-03 15:17:42,710 INFO L226 Difference]: Without dead ends: 2051 [2025-03-03 15:17:42,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:17:42,711 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 5983 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 3106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5983 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:42,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5983 Valid, 2792 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3106 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:17:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2025-03-03 15:17:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 1568. [2025-03-03 15:17:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4359974009096816) internal successors, (2210), 1567 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2210 transitions. [2025-03-03 15:17:42,729 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2210 transitions. Word has length 108 [2025-03-03 15:17:42,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:42,729 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2210 transitions. [2025-03-03 15:17:42,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:42,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2210 transitions. [2025-03-03 15:17:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:17:42,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:42,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:42,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:17:42,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -21583674, now seen corresponding path program 1 times [2025-03-03 15:17:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049189928] [2025-03-03 15:17:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:42,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:17:42,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:17:42,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:42,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049189928] [2025-03-03 15:17:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049189928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668615392] [2025-03-03 15:17:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:43,160 INFO L87 Difference]: Start difference. First operand 1568 states and 2210 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:44,234 INFO L93 Difference]: Finished difference Result 2050 states and 2906 transitions. [2025-03-03 15:17:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:17:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:44,243 INFO L225 Difference]: With dead ends: 2050 [2025-03-03 15:17:44,243 INFO L226 Difference]: Without dead ends: 1658 [2025-03-03 15:17:44,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:44,245 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 2468 mSDsluCounter, 2830 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2468 SdHoareTripleChecker+Valid, 3657 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:44,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2468 Valid, 3657 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:44,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-03-03 15:17:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1568. [2025-03-03 15:17:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4353476283300846) internal successors, (2209), 1567 states have internal predecessors, (2209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2209 transitions. [2025-03-03 15:17:44,262 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2209 transitions. Word has length 108 [2025-03-03 15:17:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:44,262 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2209 transitions. [2025-03-03 15:17:44,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2209 transitions. [2025-03-03 15:17:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:17:44,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:44,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:17:44,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:44,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1730853722, now seen corresponding path program 1 times [2025-03-03 15:17:44,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:44,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313042488] [2025-03-03 15:17:44,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:44,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:44,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:17:44,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:17:44,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:44,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313042488] [2025-03-03 15:17:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313042488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:44,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:44,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060776587] [2025-03-03 15:17:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:44,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:44,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:44,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:44,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:44,596 INFO L87 Difference]: Start difference. First operand 1568 states and 2209 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:46,208 INFO L93 Difference]: Finished difference Result 2721 states and 3853 transitions. [2025-03-03 15:17:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:17:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:46,214 INFO L225 Difference]: With dead ends: 2721 [2025-03-03 15:17:46,214 INFO L226 Difference]: Without dead ends: 2453 [2025-03-03 15:17:46,214 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:46,215 INFO L435 NwaCegarLoop]: 1000 mSDtfsCounter, 6474 mSDsluCounter, 4277 mSDsCounter, 0 mSdLazyCounter, 4211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6474 SdHoareTripleChecker+Valid, 5277 SdHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:46,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6474 Valid, 5277 Invalid, 4218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4211 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:17:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-03-03 15:17:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1568. [2025-03-03 15:17:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4346978557504872) internal successors, (2208), 1567 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2208 transitions. [2025-03-03 15:17:46,233 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2208 transitions. Word has length 108 [2025-03-03 15:17:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:46,233 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2208 transitions. [2025-03-03 15:17:46,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2208 transitions. [2025-03-03 15:17:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:46,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:46,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:17:46,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:46,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 596736680, now seen corresponding path program 1 times [2025-03-03 15:17:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:46,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218306014] [2025-03-03 15:17:46,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:46,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:46,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:46,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:46,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218306014] [2025-03-03 15:17:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218306014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:46,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271553314] [2025-03-03 15:17:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:46,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:46,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:46,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:46,565 INFO L87 Difference]: Start difference. First operand 1568 states and 2208 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:47,854 INFO L93 Difference]: Finished difference Result 2634 states and 3721 transitions. [2025-03-03 15:17:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:47,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:47,860 INFO L225 Difference]: With dead ends: 2634 [2025-03-03 15:17:47,860 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:17:47,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:47,862 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 7923 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 3227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7923 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:47,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7923 Valid, 3922 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3227 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:17:47,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:17:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:17:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4340480831708902) internal successors, (2207), 1567 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2207 transitions. [2025-03-03 15:17:47,881 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2207 transitions. Word has length 110 [2025-03-03 15:17:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:47,881 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2207 transitions. [2025-03-03 15:17:47,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2207 transitions. [2025-03-03 15:17:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:47,884 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:47,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:17:47,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:47,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:47,884 INFO L85 PathProgramCache]: Analyzing trace with hash 10914790, now seen corresponding path program 1 times [2025-03-03 15:17:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545410030] [2025-03-03 15:17:47,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:47,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:47,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:47,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:47,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:48,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:48,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545410030] [2025-03-03 15:17:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545410030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:48,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835145848] [2025-03-03 15:17:48,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:48,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:48,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:48,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:48,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:48,143 INFO L87 Difference]: Start difference. First operand 1568 states and 2207 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:49,366 INFO L93 Difference]: Finished difference Result 2641 states and 3726 transitions. [2025-03-03 15:17:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:49,372 INFO L225 Difference]: With dead ends: 2641 [2025-03-03 15:17:49,372 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:17:49,373 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:49,373 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 5745 mSDsluCounter, 3014 mSDsCounter, 0 mSdLazyCounter, 3230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5745 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:49,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5745 Valid, 3907 Invalid, 3236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3230 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:17:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:17:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:17:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.433398310591293) internal successors, (2206), 1567 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2206 transitions. [2025-03-03 15:17:49,393 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2206 transitions. Word has length 110 [2025-03-03 15:17:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:49,393 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2206 transitions. [2025-03-03 15:17:49,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2206 transitions. [2025-03-03 15:17:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:49,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:49,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:17:49,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1787629222, now seen corresponding path program 1 times [2025-03-03 15:17:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817140954] [2025-03-03 15:17:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:49,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:49,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:49,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:49,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:49,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:49,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817140954] [2025-03-03 15:17:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817140954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087603491] [2025-03-03 15:17:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:49,789 INFO L87 Difference]: Start difference. First operand 1568 states and 2206 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:51,055 INFO L93 Difference]: Finished difference Result 2742 states and 3871 transitions. [2025-03-03 15:17:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:51,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:51,062 INFO L225 Difference]: With dead ends: 2742 [2025-03-03 15:17:51,062 INFO L226 Difference]: Without dead ends: 2453 [2025-03-03 15:17:51,063 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:51,063 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 7101 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 3702 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7101 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:51,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7101 Valid, 4529 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:17:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-03-03 15:17:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1568. [2025-03-03 15:17:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.432748538011696) internal successors, (2205), 1567 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2205 transitions. [2025-03-03 15:17:51,083 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2205 transitions. Word has length 110 [2025-03-03 15:17:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:51,083 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2205 transitions. [2025-03-03 15:17:51,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2205 transitions. [2025-03-03 15:17:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:51,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:51,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:51,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:17:51,085 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:51,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash -307529724, now seen corresponding path program 1 times [2025-03-03 15:17:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:51,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603971139] [2025-03-03 15:17:51,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:51,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:51,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:51,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:51,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603971139] [2025-03-03 15:17:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603971139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747400276] [2025-03-03 15:17:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:51,376 INFO L87 Difference]: Start difference. First operand 1568 states and 2205 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:52,801 INFO L93 Difference]: Finished difference Result 2641 states and 3724 transitions. [2025-03-03 15:17:52,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:52,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:52,817 INFO L225 Difference]: With dead ends: 2641 [2025-03-03 15:17:52,817 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:17:52,818 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:52,818 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 7419 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7419 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 3501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:52,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7419 Valid, 4290 Invalid, 3501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3494 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:17:52,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:17:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:17:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4320987654320987) internal successors, (2204), 1567 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2204 transitions. [2025-03-03 15:17:52,853 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2204 transitions. Word has length 110 [2025-03-03 15:17:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:52,853 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2204 transitions. [2025-03-03 15:17:52,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2204 transitions. [2025-03-03 15:17:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:52,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:52,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:52,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:17:52,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:52,859 INFO L85 PathProgramCache]: Analyzing trace with hash 436458389, now seen corresponding path program 1 times [2025-03-03 15:17:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041291703] [2025-03-03 15:17:52,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:52,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:52,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:52,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:52,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:52,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:53,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041291703] [2025-03-03 15:17:53,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041291703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:53,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:53,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022094246] [2025-03-03 15:17:53,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:53,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:53,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:53,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:53,182 INFO L87 Difference]: Start difference. First operand 1568 states and 2204 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:54,239 INFO L93 Difference]: Finished difference Result 2401 states and 3391 transitions. [2025-03-03 15:17:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:17:54,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:54,243 INFO L225 Difference]: With dead ends: 2401 [2025-03-03 15:17:54,243 INFO L226 Difference]: Without dead ends: 1745 [2025-03-03 15:17:54,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:17:54,244 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 4124 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 3056 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4124 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:54,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4124 Valid, 3806 Invalid, 3064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 15:17:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-03-03 15:17:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1568. [2025-03-03 15:17:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4307992202729045) internal successors, (2202), 1567 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2202 transitions. [2025-03-03 15:17:54,258 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2202 transitions. Word has length 110 [2025-03-03 15:17:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:54,259 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2202 transitions. [2025-03-03 15:17:54,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2202 transitions. [2025-03-03 15:17:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:54,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:54,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:54,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:17:54,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:54,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:54,261 INFO L85 PathProgramCache]: Analyzing trace with hash 348872772, now seen corresponding path program 1 times [2025-03-03 15:17:54,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:54,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981509262] [2025-03-03 15:17:54,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:54,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:54,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981509262] [2025-03-03 15:17:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981509262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:54,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:54,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:54,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055323668] [2025-03-03 15:17:54,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:54,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:54,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:54,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:54,504 INFO L87 Difference]: Start difference. First operand 1568 states and 2202 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:55,618 INFO L93 Difference]: Finished difference Result 2366 states and 3291 transitions. [2025-03-03 15:17:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:17:55,618 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:55,622 INFO L225 Difference]: With dead ends: 2366 [2025-03-03 15:17:55,623 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:17:55,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:17:55,624 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 6058 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6058 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:55,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6058 Valid, 3437 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2899 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:17:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:17:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4294996751137101) internal successors, (2200), 1567 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2200 transitions. [2025-03-03 15:17:55,640 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2200 transitions. Word has length 110 [2025-03-03 15:17:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:55,640 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2200 transitions. [2025-03-03 15:17:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2200 transitions. [2025-03-03 15:17:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:55,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:55,642 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:55,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:17:55,642 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:55,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1885143482, now seen corresponding path program 1 times [2025-03-03 15:17:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:55,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817486288] [2025-03-03 15:17:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:55,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:55,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:55,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:56,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:56,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817486288] [2025-03-03 15:17:56,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817486288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:56,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406936960] [2025-03-03 15:17:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:56,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:56,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:56,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:56,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:56,024 INFO L87 Difference]: Start difference. First operand 1568 states and 2200 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:57,109 INFO L93 Difference]: Finished difference Result 2266 states and 3117 transitions. [2025-03-03 15:17:57,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:57,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:57,113 INFO L225 Difference]: With dead ends: 2266 [2025-03-03 15:17:57,113 INFO L226 Difference]: Without dead ends: 2261 [2025-03-03 15:17:57,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:57,114 INFO L435 NwaCegarLoop]: 778 mSDtfsCounter, 6067 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 2863 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6067 SdHoareTripleChecker+Valid, 3224 SdHoareTripleChecker+Invalid, 2870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:57,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6067 Valid, 3224 Invalid, 2870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2863 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-03 15:17:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1568. [2025-03-03 15:17:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.428200129954516) internal successors, (2198), 1567 states have internal predecessors, (2198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2198 transitions. [2025-03-03 15:17:57,125 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2198 transitions. Word has length 110 [2025-03-03 15:17:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:57,125 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2198 transitions. [2025-03-03 15:17:57,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2198 transitions. [2025-03-03 15:17:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:57,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:57,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:57,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:17:57,127 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:57,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash 575293969, now seen corresponding path program 1 times [2025-03-03 15:17:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:57,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289237753] [2025-03-03 15:17:57,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:57,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:57,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:57,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:57,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289237753] [2025-03-03 15:17:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289237753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:57,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155626604] [2025-03-03 15:17:57,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:57,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:57,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:57,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:57,312 INFO L87 Difference]: Start difference. First operand 1568 states and 2198 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:58,407 INFO L93 Difference]: Finished difference Result 2537 states and 3540 transitions. [2025-03-03 15:17:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:58,410 INFO L225 Difference]: With dead ends: 2537 [2025-03-03 15:17:58,410 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:17:58,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:58,411 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 6048 mSDsluCounter, 2642 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6048 SdHoareTripleChecker+Valid, 3440 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:58,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6048 Valid, 3440 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:17:58,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:17:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4269005847953216) internal successors, (2196), 1567 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2196 transitions. [2025-03-03 15:17:58,426 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2196 transitions. Word has length 110 [2025-03-03 15:17:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2196 transitions. [2025-03-03 15:17:58,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2196 transitions. [2025-03-03 15:17:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:58,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:58,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:17:58,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1608086291, now seen corresponding path program 1 times [2025-03-03 15:17:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801501918] [2025-03-03 15:17:58,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:58,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:58,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:58,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:58,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:17:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:17:58,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:17:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801501918] [2025-03-03 15:17:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801501918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:17:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:17:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:17:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496316279] [2025-03-03 15:17:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:17:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:17:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:17:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:17:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:17:58,707 INFO L87 Difference]: Start difference. First operand 1568 states and 2196 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:17:59,884 INFO L93 Difference]: Finished difference Result 2611 states and 3658 transitions. [2025-03-03 15:17:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:17:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:17:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:17:59,888 INFO L225 Difference]: With dead ends: 2611 [2025-03-03 15:17:59,888 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:17:59,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:17:59,889 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 7581 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7581 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:17:59,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7581 Valid, 4003 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:17:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:17:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:17:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4256010396361274) internal successors, (2194), 1567 states have internal predecessors, (2194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2194 transitions. [2025-03-03 15:17:59,904 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2194 transitions. Word has length 110 [2025-03-03 15:17:59,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:17:59,904 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2194 transitions. [2025-03-03 15:17:59,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:17:59,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2194 transitions. [2025-03-03 15:17:59,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:17:59,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:17:59,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:17:59,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:17:59,906 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:17:59,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:17:59,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1746286174, now seen corresponding path program 1 times [2025-03-03 15:17:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:17:59,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428533431] [2025-03-03 15:17:59,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:17:59,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:17:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:17:59,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:17:59,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:17:59,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428533431] [2025-03-03 15:18:00,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428533431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:00,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:00,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930651846] [2025-03-03 15:18:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:00,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:00,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:00,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:00,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:00,120 INFO L87 Difference]: Start difference. First operand 1568 states and 2194 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:01,321 INFO L93 Difference]: Finished difference Result 2611 states and 3656 transitions. [2025-03-03 15:18:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-03 15:18:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:01,324 INFO L225 Difference]: With dead ends: 2611 [2025-03-03 15:18:01,324 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:01,325 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:18:01,325 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 3625 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3625 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 3297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:01,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3625 Valid, 4000 Invalid, 3297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:01,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.424301494476933) internal successors, (2192), 1567 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2192 transitions. [2025-03-03 15:18:01,336 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2192 transitions. Word has length 110 [2025-03-03 15:18:01,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:01,336 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2192 transitions. [2025-03-03 15:18:01,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2192 transitions. [2025-03-03 15:18:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:01,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:01,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:18:01,338 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1758211035, now seen corresponding path program 1 times [2025-03-03 15:18:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637134746] [2025-03-03 15:18:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:01,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:01,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:01,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:01,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:01,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637134746] [2025-03-03 15:18:01,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637134746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:01,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319455117] [2025-03-03 15:18:01,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:01,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:01,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:01,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:01,555 INFO L87 Difference]: Start difference. First operand 1568 states and 2192 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:03,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:03,003 INFO L93 Difference]: Finished difference Result 2585 states and 3618 transitions. [2025-03-03 15:18:03,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:03,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:03,009 INFO L225 Difference]: With dead ends: 2585 [2025-03-03 15:18:03,009 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:03,010 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:18:03,011 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 6442 mSDsluCounter, 4104 mSDsCounter, 0 mSdLazyCounter, 4120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6442 SdHoareTripleChecker+Valid, 5082 SdHoareTripleChecker+Invalid, 4126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:03,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6442 Valid, 5082 Invalid, 4126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4120 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 15:18:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.423651721897336) internal successors, (2191), 1567 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2191 transitions. [2025-03-03 15:18:03,028 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2191 transitions. Word has length 112 [2025-03-03 15:18:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:03,029 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2191 transitions. [2025-03-03 15:18:03,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:03,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2191 transitions. [2025-03-03 15:18:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:03,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:03,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:03,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:18:03,031 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1844862680, now seen corresponding path program 1 times [2025-03-03 15:18:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:03,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037119725] [2025-03-03 15:18:03,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:03,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:03,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:03,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037119725] [2025-03-03 15:18:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037119725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:03,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211811061] [2025-03-03 15:18:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:03,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:03,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:03,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:03,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:03,253 INFO L87 Difference]: Start difference. First operand 1568 states and 2191 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:04,405 INFO L93 Difference]: Finished difference Result 2527 states and 3521 transitions. [2025-03-03 15:18:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:04,411 INFO L225 Difference]: With dead ends: 2527 [2025-03-03 15:18:04,411 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:04,411 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:18:04,412 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 3788 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3788 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:04,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3788 Valid, 3681 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:04,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4230019493177388) internal successors, (2190), 1567 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2190 transitions. [2025-03-03 15:18:04,426 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2190 transitions. Word has length 112 [2025-03-03 15:18:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:04,426 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2190 transitions. [2025-03-03 15:18:04,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2190 transitions. [2025-03-03 15:18:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:04,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:04,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:18:04,428 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:04,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash -200946170, now seen corresponding path program 1 times [2025-03-03 15:18:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108748518] [2025-03-03 15:18:04,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:04,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:04,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:04,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:04,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:04,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:04,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108748518] [2025-03-03 15:18:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108748518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:04,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568675684] [2025-03-03 15:18:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:04,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:04,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:04,608 INFO L87 Difference]: Start difference. First operand 1568 states and 2190 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:05,833 INFO L93 Difference]: Finished difference Result 2592 states and 3621 transitions. [2025-03-03 15:18:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:05,836 INFO L225 Difference]: With dead ends: 2592 [2025-03-03 15:18:05,837 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:05,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:05,838 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 7560 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 3278 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7560 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:05,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7560 Valid, 3988 Invalid, 3285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4223521767381417) internal successors, (2189), 1567 states have internal predecessors, (2189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2189 transitions. [2025-03-03 15:18:05,851 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2189 transitions. Word has length 112 [2025-03-03 15:18:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:05,851 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2189 transitions. [2025-03-03 15:18:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2189 transitions. [2025-03-03 15:18:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:05,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:05,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:18:05,853 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:05,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:05,854 INFO L85 PathProgramCache]: Analyzing trace with hash 580154274, now seen corresponding path program 1 times [2025-03-03 15:18:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:05,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56840457] [2025-03-03 15:18:05,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:05,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:05,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:05,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:05,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:06,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:06,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56840457] [2025-03-03 15:18:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56840457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:06,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:06,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:06,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833452193] [2025-03-03 15:18:06,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:06,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:06,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:06,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:06,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:06,048 INFO L87 Difference]: Start difference. First operand 1568 states and 2189 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:07,118 INFO L93 Difference]: Finished difference Result 2433 states and 3356 transitions. [2025-03-03 15:18:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:07,123 INFO L225 Difference]: With dead ends: 2433 [2025-03-03 15:18:07,123 INFO L226 Difference]: Without dead ends: 2261 [2025-03-03 15:18:07,124 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:18:07,124 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 7908 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7908 SdHoareTripleChecker+Valid, 3273 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7908 Valid, 3273 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-03 15:18:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1568. [2025-03-03 15:18:07,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4217024041585444) internal successors, (2188), 1567 states have internal predecessors, (2188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2188 transitions. [2025-03-03 15:18:07,143 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2188 transitions. Word has length 112 [2025-03-03 15:18:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:07,144 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2188 transitions. [2025-03-03 15:18:07,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2188 transitions. [2025-03-03 15:18:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:07,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:07,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:18:07,146 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:07,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1283454716, now seen corresponding path program 1 times [2025-03-03 15:18:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641195389] [2025-03-03 15:18:07,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:07,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:07,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:07,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:07,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:07,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:07,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641195389] [2025-03-03 15:18:07,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641195389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:07,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623892746] [2025-03-03 15:18:07,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:07,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:07,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:07,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:07,445 INFO L87 Difference]: Start difference. First operand 1568 states and 2188 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:08,654 INFO L93 Difference]: Finished difference Result 2592 states and 3619 transitions. [2025-03-03 15:18:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:08,657 INFO L225 Difference]: With dead ends: 2592 [2025-03-03 15:18:08,657 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:08,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:08,658 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 7552 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7552 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:08,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7552 Valid, 3988 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3265 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4210526315789473) internal successors, (2187), 1567 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2187 transitions. [2025-03-03 15:18:08,671 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2187 transitions. Word has length 112 [2025-03-03 15:18:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2187 transitions. [2025-03-03 15:18:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2187 transitions. [2025-03-03 15:18:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:08,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:08,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:08,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:18:08,673 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:08,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:08,673 INFO L85 PathProgramCache]: Analyzing trace with hash -502087155, now seen corresponding path program 1 times [2025-03-03 15:18:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:08,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372663908] [2025-03-03 15:18:08,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:08,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:08,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:08,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:08,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372663908] [2025-03-03 15:18:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372663908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022179627] [2025-03-03 15:18:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:08,907 INFO L87 Difference]: Start difference. First operand 1568 states and 2187 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:10,273 INFO L93 Difference]: Finished difference Result 2587 states and 3612 transitions. [2025-03-03 15:18:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:10,276 INFO L225 Difference]: With dead ends: 2587 [2025-03-03 15:18:10,276 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:10,276 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:18:10,277 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 6519 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 3904 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6519 SdHoareTripleChecker+Valid, 4864 SdHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:10,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6519 Valid, 4864 Invalid, 3911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4204028589993503) internal successors, (2186), 1567 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2186 transitions. [2025-03-03 15:18:10,290 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2186 transitions. Word has length 112 [2025-03-03 15:18:10,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:10,290 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2186 transitions. [2025-03-03 15:18:10,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2186 transitions. [2025-03-03 15:18:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:10,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:10,292 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:10,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:18:10,292 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:10,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1696504442, now seen corresponding path program 1 times [2025-03-03 15:18:10,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:10,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109568865] [2025-03-03 15:18:10,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:10,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:10,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:10,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:10,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109568865] [2025-03-03 15:18:10,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109568865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115638138] [2025-03-03 15:18:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:10,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:10,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:10,484 INFO L87 Difference]: Start difference. First operand 1568 states and 2186 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:11,950 INFO L93 Difference]: Finished difference Result 2655 states and 3708 transitions. [2025-03-03 15:18:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:11,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:11,953 INFO L225 Difference]: With dead ends: 2655 [2025-03-03 15:18:11,953 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:18:11,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:11,954 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 7010 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 3625 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7010 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 3631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:11,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7010 Valid, 4461 Invalid, 3631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3625 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:18:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:18:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4197530864197532) internal successors, (2185), 1567 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2185 transitions. [2025-03-03 15:18:11,968 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2185 transitions. Word has length 112 [2025-03-03 15:18:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2185 transitions. [2025-03-03 15:18:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2185 transitions. [2025-03-03 15:18:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:11,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:11,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:11,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:18:11,970 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:11,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash -437290923, now seen corresponding path program 1 times [2025-03-03 15:18:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:11,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006746877] [2025-03-03 15:18:11,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:11,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006746877] [2025-03-03 15:18:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006746877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:12,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460679941] [2025-03-03 15:18:12,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:12,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:12,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:12,170 INFO L87 Difference]: Start difference. First operand 1568 states and 2185 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:13,315 INFO L93 Difference]: Finished difference Result 2531 states and 3517 transitions. [2025-03-03 15:18:13,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:13,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:13,318 INFO L225 Difference]: With dead ends: 2531 [2025-03-03 15:18:13,318 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:13,318 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:18:13,318 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 5596 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5596 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 3207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:13,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5596 Valid, 3889 Invalid, 3207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4191033138401559) internal successors, (2184), 1567 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2184 transitions. [2025-03-03 15:18:13,330 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2184 transitions. Word has length 112 [2025-03-03 15:18:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2184 transitions. [2025-03-03 15:18:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2184 transitions. [2025-03-03 15:18:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:13,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:13,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:13,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:18:13,332 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2064349751, now seen corresponding path program 1 times [2025-03-03 15:18:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:13,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744423713] [2025-03-03 15:18:13,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:13,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:13,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:13,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:13,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:13,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744423713] [2025-03-03 15:18:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744423713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324677951] [2025-03-03 15:18:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:13,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:13,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:13,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:13,534 INFO L87 Difference]: Start difference. First operand 1568 states and 2184 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:14,900 INFO L93 Difference]: Finished difference Result 2825 states and 3956 transitions. [2025-03-03 15:18:14,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:14,900 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:14,902 INFO L225 Difference]: With dead ends: 2825 [2025-03-03 15:18:14,902 INFO L226 Difference]: Without dead ends: 2453 [2025-03-03 15:18:14,903 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:18:14,904 INFO L435 NwaCegarLoop]: 1210 mSDtfsCounter, 4699 mSDsluCounter, 3988 mSDsCounter, 0 mSdLazyCounter, 4012 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4699 SdHoareTripleChecker+Valid, 5198 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:14,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4699 Valid, 5198 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4012 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-03-03 15:18:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1568. [2025-03-03 15:18:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4178037686809617) internal successors, (2182), 1567 states have internal predecessors, (2182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2182 transitions. [2025-03-03 15:18:14,916 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2182 transitions. Word has length 112 [2025-03-03 15:18:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2182 transitions. [2025-03-03 15:18:14,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2182 transitions. [2025-03-03 15:18:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:14,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:14,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:14,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:18:14,918 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:14,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:14,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1642916030, now seen corresponding path program 1 times [2025-03-03 15:18:14,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:14,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549569555] [2025-03-03 15:18:14,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:14,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:14,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:14,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:15,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:15,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549569555] [2025-03-03 15:18:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549569555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:15,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:15,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079064122] [2025-03-03 15:18:15,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:15,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:15,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:15,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:15,127 INFO L87 Difference]: Start difference. First operand 1568 states and 2182 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:16,400 INFO L93 Difference]: Finished difference Result 2685 states and 3751 transitions. [2025-03-03 15:18:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:16,402 INFO L225 Difference]: With dead ends: 2685 [2025-03-03 15:18:16,402 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:18:16,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:16,403 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 6875 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6875 SdHoareTripleChecker+Valid, 4630 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:16,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6875 Valid, 4630 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:18:16,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:18:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4165042235217673) internal successors, (2180), 1567 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2180 transitions. [2025-03-03 15:18:16,420 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2180 transitions. Word has length 112 [2025-03-03 15:18:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2180 transitions. [2025-03-03 15:18:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2180 transitions. [2025-03-03 15:18:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:16,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:16,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:16,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:18:16,422 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:16,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash -166992576, now seen corresponding path program 1 times [2025-03-03 15:18:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661292907] [2025-03-03 15:18:16,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:16,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:16,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:16,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:16,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:16,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661292907] [2025-03-03 15:18:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661292907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:16,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750854646] [2025-03-03 15:18:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:16,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:16,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:16,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:16,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:16,661 INFO L87 Difference]: Start difference. First operand 1568 states and 2180 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:18,022 INFO L93 Difference]: Finished difference Result 2607 states and 3634 transitions. [2025-03-03 15:18:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:18,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:18,025 INFO L225 Difference]: With dead ends: 2607 [2025-03-03 15:18:18,025 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:18,025 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:18:18,026 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 6341 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 4157 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6341 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:18,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6341 Valid, 5204 Invalid, 4164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4157 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4152046783625731) internal successors, (2178), 1567 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2178 transitions. [2025-03-03 15:18:18,036 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2178 transitions. Word has length 112 [2025-03-03 15:18:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:18,036 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2178 transitions. [2025-03-03 15:18:18,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2178 transitions. [2025-03-03 15:18:18,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:18,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:18,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:18,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:18:18,037 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:18,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:18,038 INFO L85 PathProgramCache]: Analyzing trace with hash 347259157, now seen corresponding path program 1 times [2025-03-03 15:18:18,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:18,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465799480] [2025-03-03 15:18:18,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:18,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:18,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:18,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:18,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465799480] [2025-03-03 15:18:18,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465799480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:18,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:18,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:18,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599027999] [2025-03-03 15:18:18,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:18,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:18,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:18,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:18,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:18,227 INFO L87 Difference]: Start difference. First operand 1568 states and 2178 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:19,422 INFO L93 Difference]: Finished difference Result 2631 states and 3655 transitions. [2025-03-03 15:18:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:19,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:19,424 INFO L225 Difference]: With dead ends: 2631 [2025-03-03 15:18:19,424 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:19,425 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:18:19,425 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 5275 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 3500 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5275 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:19,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5275 Valid, 4340 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3500 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4139051332033787) internal successors, (2176), 1567 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2176 transitions. [2025-03-03 15:18:19,440 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2176 transitions. Word has length 112 [2025-03-03 15:18:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:19,441 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2176 transitions. [2025-03-03 15:18:19,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2176 transitions. [2025-03-03 15:18:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:19,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:19,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:18:19,443 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:19,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:19,443 INFO L85 PathProgramCache]: Analyzing trace with hash 977441559, now seen corresponding path program 1 times [2025-03-03 15:18:19,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330050221] [2025-03-03 15:18:19,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:19,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:19,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:19,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:19,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:19,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330050221] [2025-03-03 15:18:19,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330050221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:19,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:19,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:19,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266220239] [2025-03-03 15:18:19,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:19,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:19,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:19,731 INFO L87 Difference]: Start difference. First operand 1568 states and 2176 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:21,048 INFO L93 Difference]: Finished difference Result 2877 states and 4014 transitions. [2025-03-03 15:18:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:21,050 INFO L225 Difference]: With dead ends: 2877 [2025-03-03 15:18:21,050 INFO L226 Difference]: Without dead ends: 2453 [2025-03-03 15:18:21,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:21,051 INFO L435 NwaCegarLoop]: 1254 mSDtfsCounter, 4497 mSDsluCounter, 4115 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 5369 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:21,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 5369 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-03-03 15:18:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1568. [2025-03-03 15:18:21,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4126055880441846) internal successors, (2174), 1567 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2174 transitions. [2025-03-03 15:18:21,062 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2174 transitions. Word has length 112 [2025-03-03 15:18:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2174 transitions. [2025-03-03 15:18:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2174 transitions. [2025-03-03 15:18:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:21,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:21,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:21,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:18:21,064 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:21,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1458913982, now seen corresponding path program 1 times [2025-03-03 15:18:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:21,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275885950] [2025-03-03 15:18:21,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:21,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:21,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:21,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275885950] [2025-03-03 15:18:21,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275885950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:21,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:21,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636338004] [2025-03-03 15:18:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:21,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:21,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:21,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:21,232 INFO L87 Difference]: Start difference. First operand 1568 states and 2174 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:22,430 INFO L93 Difference]: Finished difference Result 2623 states and 3643 transitions. [2025-03-03 15:18:22,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:22,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:22,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:22,433 INFO L225 Difference]: With dead ends: 2623 [2025-03-03 15:18:22,433 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:22,434 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:18:22,434 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 3435 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 3492 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3435 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 3498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:22,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3435 Valid, 4340 Invalid, 3498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3492 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4113060428849902) internal successors, (2172), 1567 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2172 transitions. [2025-03-03 15:18:22,446 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2172 transitions. Word has length 112 [2025-03-03 15:18:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2172 transitions. [2025-03-03 15:18:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2172 transitions. [2025-03-03 15:18:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:22,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:22,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:18:22,448 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:22,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1685335179, now seen corresponding path program 1 times [2025-03-03 15:18:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577452109] [2025-03-03 15:18:22,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:22,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:22,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:22,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:22,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:22,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577452109] [2025-03-03 15:18:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577452109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:22,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069762824] [2025-03-03 15:18:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:22,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:22,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:22,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:22,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:22,639 INFO L87 Difference]: Start difference. First operand 1568 states and 2172 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:23,946 INFO L93 Difference]: Finished difference Result 2705 states and 3762 transitions. [2025-03-03 15:18:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:23,949 INFO L225 Difference]: With dead ends: 2705 [2025-03-03 15:18:23,949 INFO L226 Difference]: Without dead ends: 2421 [2025-03-03 15:18:23,950 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:18:23,950 INFO L435 NwaCegarLoop]: 1187 mSDtfsCounter, 6222 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6222 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:23,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6222 Valid, 5086 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2025-03-03 15:18:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1568. [2025-03-03 15:18:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.410006497725796) internal successors, (2170), 1567 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2170 transitions. [2025-03-03 15:18:23,962 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2170 transitions. Word has length 112 [2025-03-03 15:18:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2170 transitions. [2025-03-03 15:18:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2170 transitions. [2025-03-03 15:18:23,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:18:23,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:23,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:23,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:18:23,965 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:23,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1576839795, now seen corresponding path program 1 times [2025-03-03 15:18:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601482662] [2025-03-03 15:18:23,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:23,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:18:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:18:23,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:23,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:24,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:18:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601482662] [2025-03-03 15:18:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601482662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115663745] [2025-03-03 15:18:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:24,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:24,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:24,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:24,145 INFO L87 Difference]: Start difference. First operand 1568 states and 2170 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:25,335 INFO L93 Difference]: Finished difference Result 2615 states and 3629 transitions. [2025-03-03 15:18:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:25,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-03 15:18:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:25,337 INFO L225 Difference]: With dead ends: 2615 [2025-03-03 15:18:25,337 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:25,338 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:18:25,338 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 5041 mSDsluCounter, 3482 mSDsCounter, 0 mSdLazyCounter, 3617 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5041 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:25,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5041 Valid, 4539 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3617 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4087069525666016) internal successors, (2168), 1567 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2168 transitions. [2025-03-03 15:18:25,348 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2168 transitions. Word has length 112 [2025-03-03 15:18:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:25,348 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2168 transitions. [2025-03-03 15:18:25,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2168 transitions. [2025-03-03 15:18:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:25,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:25,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:18:25,350 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:25,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1924274555, now seen corresponding path program 1 times [2025-03-03 15:18:25,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:25,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170926416] [2025-03-03 15:18:25,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:25,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:25,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:25,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:25,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170926416] [2025-03-03 15:18:25,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170926416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:25,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:25,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209567188] [2025-03-03 15:18:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:25,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:25,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:25,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:25,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:25,533 INFO L87 Difference]: Start difference. First operand 1568 states and 2168 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:26,810 INFO L93 Difference]: Finished difference Result 2526 states and 3494 transitions. [2025-03-03 15:18:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:26,813 INFO L225 Difference]: With dead ends: 2526 [2025-03-03 15:18:26,813 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:26,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:26,814 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 4210 mSDsluCounter, 3206 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4210 SdHoareTripleChecker+Valid, 4193 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:26,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4210 Valid, 4193 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4080571799870045) internal successors, (2167), 1567 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2167 transitions. [2025-03-03 15:18:26,828 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2167 transitions. Word has length 114 [2025-03-03 15:18:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:26,828 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2167 transitions. [2025-03-03 15:18:26,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2167 transitions. [2025-03-03 15:18:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:26,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:26,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:26,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:18:26,830 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:26,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash -454819000, now seen corresponding path program 1 times [2025-03-03 15:18:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701750979] [2025-03-03 15:18:26,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:26,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:26,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:26,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:26,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:27,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:27,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701750979] [2025-03-03 15:18:27,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701750979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:27,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:27,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309475546] [2025-03-03 15:18:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:27,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:27,027 INFO L87 Difference]: Start difference. First operand 1568 states and 2167 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:28,330 INFO L93 Difference]: Finished difference Result 2587 states and 3587 transitions. [2025-03-03 15:18:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:28,332 INFO L225 Difference]: With dead ends: 2587 [2025-03-03 15:18:28,332 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:28,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:28,333 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 4865 mSDsluCounter, 3657 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4865 SdHoareTripleChecker+Valid, 4774 SdHoareTripleChecker+Invalid, 3811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:28,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4865 Valid, 4774 Invalid, 3811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3805 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:28,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4074074074074074) internal successors, (2166), 1567 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2166 transitions. [2025-03-03 15:18:28,344 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2166 transitions. Word has length 114 [2025-03-03 15:18:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:28,344 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2166 transitions. [2025-03-03 15:18:28,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2166 transitions. [2025-03-03 15:18:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:28,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:28,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:28,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:18:28,346 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:28,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1557291001, now seen corresponding path program 1 times [2025-03-03 15:18:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:28,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171994709] [2025-03-03 15:18:28,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:28,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:28,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:28,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:28,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:28,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171994709] [2025-03-03 15:18:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171994709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:28,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:28,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:28,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363002657] [2025-03-03 15:18:28,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:28,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:28,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:28,600 INFO L87 Difference]: Start difference. First operand 1568 states and 2166 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:29,945 INFO L93 Difference]: Finished difference Result 2526 states and 3491 transitions. [2025-03-03 15:18:29,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:29,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:29,947 INFO L225 Difference]: With dead ends: 2526 [2025-03-03 15:18:29,947 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:29,948 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:18:29,948 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 6327 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 4057 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6327 SdHoareTripleChecker+Valid, 5081 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:29,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6327 Valid, 5081 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4067576348278104) internal successors, (2165), 1567 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2165 transitions. [2025-03-03 15:18:29,961 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2165 transitions. Word has length 114 [2025-03-03 15:18:29,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:29,961 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2165 transitions. [2025-03-03 15:18:29,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2165 transitions. [2025-03-03 15:18:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:29,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:29,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:29,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:18:29,963 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:29,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash 873429158, now seen corresponding path program 1 times [2025-03-03 15:18:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:29,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301498528] [2025-03-03 15:18:29,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:29,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:29,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:29,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:29,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301498528] [2025-03-03 15:18:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301498528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:30,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:30,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010119572] [2025-03-03 15:18:30,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:30,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:30,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:30,139 INFO L87 Difference]: Start difference. First operand 1568 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:31,339 INFO L93 Difference]: Finished difference Result 2531 states and 3494 transitions. [2025-03-03 15:18:31,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:31,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:31,342 INFO L225 Difference]: With dead ends: 2531 [2025-03-03 15:18:31,342 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:31,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:18:31,342 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 4171 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 3451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4171 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 3457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:31,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4171 Valid, 4253 Invalid, 3457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3451 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 15:18:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:31,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.406107862248213) internal successors, (2164), 1567 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2164 transitions. [2025-03-03 15:18:31,355 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2164 transitions. Word has length 114 [2025-03-03 15:18:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2164 transitions. [2025-03-03 15:18:31,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2164 transitions. [2025-03-03 15:18:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:31,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:31,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:31,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:18:31,356 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:31,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:31,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1664278468, now seen corresponding path program 1 times [2025-03-03 15:18:31,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:31,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815267998] [2025-03-03 15:18:31,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:31,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:31,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:31,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:31,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:31,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815267998] [2025-03-03 15:18:31,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815267998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641506748] [2025-03-03 15:18:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:31,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:31,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:31,600 INFO L87 Difference]: Start difference. First operand 1568 states and 2164 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:32,927 INFO L93 Difference]: Finished difference Result 2527 states and 3489 transitions. [2025-03-03 15:18:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:32,927 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:32,930 INFO L225 Difference]: With dead ends: 2527 [2025-03-03 15:18:32,930 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:32,930 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:18:32,931 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 6318 mSDsluCounter, 4076 mSDsCounter, 0 mSdLazyCounter, 4042 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6318 SdHoareTripleChecker+Valid, 5081 SdHoareTripleChecker+Invalid, 4049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:32,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6318 Valid, 5081 Invalid, 4049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4042 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1568. [2025-03-03 15:18:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.405458089668616) internal successors, (2163), 1567 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2163 transitions. [2025-03-03 15:18:32,942 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2163 transitions. Word has length 114 [2025-03-03 15:18:32,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:32,942 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2163 transitions. [2025-03-03 15:18:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2163 transitions. [2025-03-03 15:18:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:32,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:32,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:32,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:18:32,944 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:32,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:32,944 INFO L85 PathProgramCache]: Analyzing trace with hash 587588642, now seen corresponding path program 1 times [2025-03-03 15:18:32,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:32,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507950470] [2025-03-03 15:18:32,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:32,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:33,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:33,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507950470] [2025-03-03 15:18:33,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507950470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:33,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550569039] [2025-03-03 15:18:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:33,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:33,128 INFO L87 Difference]: Start difference. First operand 1568 states and 2163 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:34,439 INFO L93 Difference]: Finished difference Result 2587 states and 3579 transitions. [2025-03-03 15:18:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:34,442 INFO L225 Difference]: With dead ends: 2587 [2025-03-03 15:18:34,442 INFO L226 Difference]: Without dead ends: 2397 [2025-03-03 15:18:34,442 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:18:34,443 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 4778 mSDsluCounter, 4348 mSDsCounter, 0 mSdLazyCounter, 4210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4778 SdHoareTripleChecker+Valid, 5406 SdHoareTripleChecker+Invalid, 4216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:34,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4778 Valid, 5406 Invalid, 4216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4210 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2397 states. [2025-03-03 15:18:34,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2397 to 1568. [2025-03-03 15:18:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4048083170890189) internal successors, (2162), 1567 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2162 transitions. [2025-03-03 15:18:34,453 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2162 transitions. Word has length 114 [2025-03-03 15:18:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:34,453 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2162 transitions. [2025-03-03 15:18:34,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:34,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2162 transitions. [2025-03-03 15:18:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:34,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:34,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:34,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:18:34,455 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:34,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash -913610505, now seen corresponding path program 1 times [2025-03-03 15:18:34,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:34,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545591804] [2025-03-03 15:18:34,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:34,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:34,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:34,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:34,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:34,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:34,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:34,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545591804] [2025-03-03 15:18:34,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545591804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:34,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:34,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:34,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791545830] [2025-03-03 15:18:34,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:34,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:34,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:34,654 INFO L87 Difference]: Start difference. First operand 1568 states and 2162 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:35,748 INFO L93 Difference]: Finished difference Result 2431 states and 3326 transitions. [2025-03-03 15:18:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:18:35,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:35,750 INFO L225 Difference]: With dead ends: 2431 [2025-03-03 15:18:35,750 INFO L226 Difference]: Without dead ends: 2261 [2025-03-03 15:18:35,751 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:18:35,751 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 5783 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5783 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:35,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5783 Valid, 3404 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2934 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:18:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2025-03-03 15:18:35,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1568. [2025-03-03 15:18:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1539 states have (on average 1.4041585445094218) internal successors, (2161), 1567 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2161 transitions. [2025-03-03 15:18:35,764 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2161 transitions. Word has length 114 [2025-03-03 15:18:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:35,764 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2161 transitions. [2025-03-03 15:18:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2161 transitions. [2025-03-03 15:18:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:35,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:35,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:35,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:18:35,766 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash -35206524, now seen corresponding path program 1 times [2025-03-03 15:18:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232522625] [2025-03-03 15:18:35,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:35,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:35,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:35,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:35,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:35,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:36,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232522625] [2025-03-03 15:18:36,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232522625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:36,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:36,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:36,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70921136] [2025-03-03 15:18:36,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:36,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:36,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:36,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:36,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:36,162 INFO L87 Difference]: Start difference. First operand 1568 states and 2161 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:37,956 INFO L93 Difference]: Finished difference Result 3035 states and 4222 transitions. [2025-03-03 15:18:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:18:37,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:37,959 INFO L225 Difference]: With dead ends: 3035 [2025-03-03 15:18:37,959 INFO L226 Difference]: Without dead ends: 2853 [2025-03-03 15:18:37,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:18:37,960 INFO L435 NwaCegarLoop]: 1016 mSDtfsCounter, 9693 mSDsluCounter, 3598 mSDsCounter, 0 mSdLazyCounter, 3732 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9693 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 4071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 3732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:37,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9693 Valid, 4614 Invalid, 4071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 3732 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:18:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2025-03-03 15:18:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1572. [2025-03-03 15:18:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4031108230719378) internal successors, (2165), 1571 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2165 transitions. [2025-03-03 15:18:37,982 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2165 transitions. Word has length 114 [2025-03-03 15:18:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:37,982 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2165 transitions. [2025-03-03 15:18:37,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2165 transitions. [2025-03-03 15:18:37,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:37,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:37,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:37,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:18:37,984 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:37,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash 755909903, now seen corresponding path program 1 times [2025-03-03 15:18:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:37,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91109518] [2025-03-03 15:18:37,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:38,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:38,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:38,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:38,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91109518] [2025-03-03 15:18:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91109518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:38,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228880044] [2025-03-03 15:18:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:38,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:38,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:38,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:38,234 INFO L87 Difference]: Start difference. First operand 1572 states and 2165 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:39,519 INFO L93 Difference]: Finished difference Result 2527 states and 3485 transitions. [2025-03-03 15:18:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:18:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:39,522 INFO L225 Difference]: With dead ends: 2527 [2025-03-03 15:18:39,522 INFO L226 Difference]: Without dead ends: 2349 [2025-03-03 15:18:39,522 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:18:39,523 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 6144 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 3613 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6144 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:39,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6144 Valid, 4516 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3613 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:18:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-03 15:18:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1572. [2025-03-03 15:18:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1543 states have (on average 1.4024627349319507) internal successors, (2164), 1571 states have internal predecessors, (2164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2164 transitions. [2025-03-03 15:18:39,534 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2164 transitions. Word has length 114 [2025-03-03 15:18:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:39,534 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2164 transitions. [2025-03-03 15:18:39,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2164 transitions. [2025-03-03 15:18:39,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:39,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:39,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:18:39,536 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1424388307, now seen corresponding path program 1 times [2025-03-03 15:18:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490765316] [2025-03-03 15:18:39,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:39,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:39,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:39,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:39,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:39,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490765316] [2025-03-03 15:18:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490765316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:39,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:18:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614669040] [2025-03-03 15:18:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:39,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:18:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:18:39,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:18:39,860 INFO L87 Difference]: Start difference. First operand 1572 states and 2164 transitions. Second operand has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:18:41,737 INFO L93 Difference]: Finished difference Result 3031 states and 4216 transitions. [2025-03-03 15:18:41,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 15:18:41,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 15:18:41,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:18:41,740 INFO L225 Difference]: With dead ends: 3031 [2025-03-03 15:18:41,740 INFO L226 Difference]: Without dead ends: 2853 [2025-03-03 15:18:41,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:18:41,741 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 11665 mSDsluCounter, 4546 mSDsCounter, 0 mSdLazyCounter, 4533 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11665 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 4869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 4533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:18:41,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11665 Valid, 5556 Invalid, 4869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 4533 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:18:41,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2025-03-03 15:18:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 1576. [2025-03-03 15:18:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1547 states have (on average 1.4014221073044602) internal successors, (2168), 1575 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2168 transitions. [2025-03-03 15:18:41,754 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2168 transitions. Word has length 114 [2025-03-03 15:18:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:18:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2168 transitions. [2025-03-03 15:18:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.5) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:18:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2168 transitions. [2025-03-03 15:18:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 15:18:41,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:18:41,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:18:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:18:41,755 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-03 15:18:41,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:18:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash 121060149, now seen corresponding path program 1 times [2025-03-03 15:18:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:18:41,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428556658] [2025-03-03 15:18:41,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:18:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:18:41,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 15:18:41,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 15:18:41,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:18:41,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:18:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:18:41,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:18:41,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428556658] [2025-03-03 15:18:41,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428556658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:18:41,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:18:41,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:18:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410835608] [2025-03-03 15:18:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:18:41,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:18:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:18:41,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:18:41,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:18:41,941 INFO L87 Difference]: Start difference. First operand 1576 states and 2168 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)