./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-16 19:36:20,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:36:20,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:36:20,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:36:20,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:36:21,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:36:21,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:36:21,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:36:21,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:36:21,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:36:21,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:36:21,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:36:21,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:36:21,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:36:21,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:36:21,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:36:21,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:36:21,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:21,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:36:21,009 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:36:21,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:36:21,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:36:21,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:36:21,010 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-16 19:36:21,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:36:21,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:36:21,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:36:21,251 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:36:21,251 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:36:21,252 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-16 19:36:22,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c097103/bcf364bb8b4749afbeb400a9a1d319c4/FLAG496af6b91 [2025-03-16 19:36:22,823 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:36:22,825 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-16 19:36:22,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c097103/bcf364bb8b4749afbeb400a9a1d319c4/FLAG496af6b91 [2025-03-16 19:36:22,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60c097103/bcf364bb8b4749afbeb400a9a1d319c4 [2025-03-16 19:36:22,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:36:22,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:36:22,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:22,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:36:22,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:36:22,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:22" (1/1) ... [2025-03-16 19:36:22,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:22, skipping insertion in model container [2025-03-16 19:36:22,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:36:22" (1/1) ... [2025-03-16 19:36:22,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:36:23,334 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-16 19:36:23,352 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-16 19:36:23,362 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-16 19:36:23,370 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-16 19:36:23,376 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-16 19:36:23,381 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-16 19:36:23,387 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-16 19:36:23,396 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-16 19:36:23,399 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-16 19:36:23,405 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-16 19:36:23,413 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-16 19:36:23,425 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39985,39998] [2025-03-16 19:36:23,428 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-16 19:36:23,432 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-16 19:36:23,438 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-16 19:36:23,447 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-16 19:36:23,468 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-16 19:36:23,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[55438,55451] [2025-03-16 19:36:23,474 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-16 19:36:23,480 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-16 19:36:23,490 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-16 19:36:23,511 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-16 19:36:23,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[82335,82348] [2025-03-16 19:36:23,548 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-16 19:36:23,551 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-16 19:36:23,557 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-16 19:36:23,566 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-16 19:36:23,581 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-16 19:36:23,606 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-16 19:36:23,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:24,001 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:36:24,049 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-16 19:36:24,057 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-16 19:36:24,060 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-16 19:36:24,062 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-16 19:36:24,066 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-16 19:36:24,068 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-16 19:36:24,071 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-16 19:36:24,076 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-16 19:36:24,079 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-16 19:36:24,081 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-16 19:36:24,085 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-16 19:36:24,093 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-16 19:36:24,095 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-16 19:36:24,098 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-16 19:36:24,104 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-16 19:36:24,110 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-16 19:36:24,122 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-16 19:36:24,124 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-16 19:36:24,127 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-16 19:36:24,133 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-16 19:36:24,141 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-16 19:36:24,155 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-16 19:36:24,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82335,82348] [2025-03-16 19:36:24,181 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-16 19:36:24,185 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84328,84341] [2025-03-16 19:36:24,189 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-16 19:36:24,196 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-16 19:36:24,207 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-16 19:36:24,224 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-16 19:36:24,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:36:24,533 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:36:24,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24 WrapperNode [2025-03-16 19:36:24,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:36:24,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:24,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:36:24,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:36:24,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,751 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13514 [2025-03-16 19:36:24,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:36:24,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:36:24,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:36:24,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:36:24,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,850 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-16 19:36:24,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:24,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:25,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:36:25,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:36:25,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:36:25,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:36:25,004 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (1/1) ... [2025-03-16 19:36:25,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:36:25,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:36:25,030 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-16 19:36:25,032 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-16 19:36:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:36:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:36:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:36:25,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:36:25,337 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:36:25,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:36:29,710 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4462: havoc main_~node7__m7~25#1; [2025-03-16 19:36:29,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6576: havoc main_~node7__m7~42#1; [2025-03-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5784: havoc main_~check__tmp~47#1; [2025-03-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $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-16 19:36:29,711 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8429: havoc main_~node6__m6~31#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7372: havoc main_~node6__m6~26#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9222: havoc main_~node6____CPAchecker_TMP_0~2#1;havoc main_~node6__m6~34#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13979: havoc main_~node7____CPAchecker_TMP_0~28#1;havoc main_~node7__m7~91#1; [2025-03-16 19:36:29,712 INFO L1322 $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-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12658: havoc main_~node6____CPAchecker_TMP_0~11#1;havoc main_~node6__m6~43#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~check__tmp~25#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16094: havoc main_~node6____CPAchecker_TMP_0~20#1;havoc main_~node6__m6~52#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20851: havoc main_~node7____CPAchecker_TMP_0~64#1;havoc main_~node7__m7~127#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc main_~check__tmp~22#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4205: havoc main_~check__tmp~36#1; [2025-03-16 19:36:29,712 INFO L1322 $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-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L506: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:36:29,712 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19533: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-16 19:36:29,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2357: havoc main_~check__tmp~16#1;havoc main_~node7__m7~9#1; [2025-03-16 19:36:29,713 INFO L1322 $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-16 19:36:29,713 INFO L1322 $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-16 19:36:29,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: havoc main_~node6__m6~3#1; [2025-03-16 19:36:29,713 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5529: havoc main_~node5__m5~10#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1037: havoc main_~node6____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267: havoc main_~node6__m6~17#1; [2025-03-16 19:36:29,714 INFO L1322 $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-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11876: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-16 19:36:29,714 INFO L1322 $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-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8444: havoc main_~node7__m7~60#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7387: havoc main_~node7__m7~50#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18223: havoc main_~node7____CPAchecker_TMP_0~50#1;havoc main_~node7__m7~113#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9239: havoc main_~node7____CPAchecker_TMP_0~3#1;havoc main_~node7__m7~66#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12675: havoc main_~node7____CPAchecker_TMP_0~21#1;havoc main_~node7__m7~84#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16111: havoc main_~node7____CPAchecker_TMP_0~39#1;havoc main_~node7__m7~102#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10563: havoc main_~node7____CPAchecker_TMP_0~10#1;havoc main_~node7__m7~73#1; [2025-03-16 19:36:29,714 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6335: havoc main_~node6__m6~21#1; [2025-03-16 19:36:29,714 INFO L1322 $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-16 19:36:29,715 INFO L1322 $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-16 19:36:29,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L786: havoc main_~node2__m2~2#1; [2025-03-16 19:36:29,715 INFO L1322 $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-16 19:36:29,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17435: havoc main_~node7____CPAchecker_TMP_0~46#1;havoc main_~node7__m7~109#1; [2025-03-16 19:36:29,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1580: havoc main_~node7__m7~4#1; [2025-03-16 19:36:29,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:36:29,715 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5544: havoc main_~node6__m6~18#1; [2025-03-16 19:36:29,715 INFO L1322 $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-16 19:36:29,715 INFO L1322 $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-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19550: havoc main_~node6____CPAchecker_TMP_0~29#1;havoc main_~node6__m6~61#1; [2025-03-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc main_~check__tmp~63#1;havoc main_~node7__m7~52#1; [2025-03-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5282: havoc main_~node7__m7~32#1; [2025-03-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13211: havoc main_~node7____CPAchecker_TMP_0~24#1;havoc main_~node7__m7~87#1; [2025-03-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc main_~node7__m7~19#1; [2025-03-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11893: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-16 19:36:29,716 INFO L1322 $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-16 19:36:29,716 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18765: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14538: havoc main_~node6____CPAchecker_TMP_0~16#1;havoc main_~node6__m6~48#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11105: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~node3__m3~2#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2651: havoc main_~node7__m7~11#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7144: havoc main_~node6__m6~25#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5559: havoc main_~node7__m7~34#1; [2025-03-16 19:36:29,717 INFO L1322 $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-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L540: havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6090: havoc main_~node5__m5~11#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19567: havoc main_~node7____CPAchecker_TMP_0~57#1;havoc main_~node7__m7~120#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6884: havoc main_~node7__m7~45#1; [2025-03-16 19:36:29,717 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17983: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-16 19:36:29,717 INFO L1322 $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-16 19:36:29,718 INFO L1322 $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-16 19:36:29,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4773: havoc main_~check__tmp~41#1;havoc main_~node7__m7~27#1; [2025-03-16 19:36:29,718 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8209: havoc main_~node4__m4~9#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9795: havoc main_~node7____CPAchecker_TMP_0~6#1;havoc main_~node7__m7~69#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7945: havoc main_~node7__m7~55#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11910: havoc main_~node6____CPAchecker_TMP_0~9#1;havoc main_~node6__m6~41#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15346: havoc main_~node6____CPAchecker_TMP_0~18#1;havoc main_~node6__m6~50#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20103: havoc main_~node7____CPAchecker_TMP_0~60#1;havoc main_~node7__m7~123#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18782: havoc main_~node6____CPAchecker_TMP_0~27#1;havoc main_~node6__m6~59#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14555: havoc main_~node7____CPAchecker_TMP_0~31#1;havoc main_~node7__m7~94#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2136: havoc main_~check__tmp~13#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11122: havoc main_~node6____CPAchecker_TMP_0~7#1;havoc main_~node6__m6~39#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L816: havoc main_~node4__m4~2#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7159: havoc main_~node7__m7~48#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6105: havoc main_~node6__m6~20#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5842: havoc main_~node6__m6~19#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node7____CPAchecker_TMP_0~0#1;havoc main_~node7__m7~0#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18000: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: havoc main_~node5__m5~3#1; [2025-03-16 19:36:29,719 INFO L1322 $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-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8224: havoc main_~node5__m5~16#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10340: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-16 19:36:29,719 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~check__tmp~34#1;havoc main_~node7__m7~21#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11927: havoc main_~node7____CPAchecker_TMP_0~17#1;havoc main_~node7__m7~80#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15363: havoc main_~node7____CPAchecker_TMP_0~35#1;havoc main_~node7__m7~98#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6379: havoc main_~check__tmp~54#1;havoc main_~node7__m7~40#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18799: havoc main_~node7____CPAchecker_TMP_0~53#1;havoc main_~node7__m7~116#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L831: havoc main_~node5__m5~2#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16687: havoc main_~node7____CPAchecker_TMP_0~42#1;havoc main_~node7__m7~105#1; [2025-03-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11139: havoc main_~node7____CPAchecker_TMP_0~13#1;havoc main_~node7__m7~76#1; [2025-03-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5062: havoc main_~node5__m5~9#1; [2025-03-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6120: havoc main_~node7__m7~38#1; [2025-03-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $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-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3214: havoc main_~check__tmp~26#1;havoc main_~node7__m7~15#1; [2025-03-16 19:36:29,720 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12463: havoc main_~node7____CPAchecker_TMP_0~20#1;havoc main_~node7__m7~83#1; [2025-03-16 19:36:29,721 INFO L1322 $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-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~node7__m7~36#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19335: havoc main_~node7____CPAchecker_TMP_0~56#1;havoc main_~node7__m7~119#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2951: havoc main_~check__tmp~23#1;havoc main_~node7__m7~13#1; [2025-03-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4274: havoc main_~check__tmp~37#1;havoc main_~node7__m7~23#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node6__m6~4#1; [2025-03-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8767: havoc main_~node7__m7~64#1;havoc main_~node6__m6~33#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8239: havoc main_~node6__m6~30#1; [2025-03-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11675: havoc main_~node7____CPAchecker_TMP_0~16#1;havoc main_~node7__m7~79#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18017: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $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-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6655: havoc main_~check__tmp~56#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13790: havoc main_~node6____CPAchecker_TMP_0~14#1;havoc main_~node6__m6~46#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20662: havoc main_~node6____CPAchecker_TMP_0~32#1;havoc main_~node6__m6~64#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10357: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17229: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-16 19:36:29,722 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8509: havoc main_~node7__m7~61#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node6__m6~2#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5077: havoc main_~node6__m6~16#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7722: havoc main_~node7__m7~53#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3495: havoc main_~node3__m3~3#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: havoc main_~node7__m7~6#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5347: havoc main_~node7__m7~33#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9047: havoc main_~node7____CPAchecker_TMP_0~2#1;havoc main_~node7__m7~65#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15919: havoc main_~node7____CPAchecker_TMP_0~38#1;havoc main_~node7__m7~101#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18034: havoc main_~node6____CPAchecker_TMP_0~25#1;havoc main_~node6__m6~57#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13807: havoc main_~node7____CPAchecker_TMP_0~27#1;havoc main_~node7__m7~90#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7465: havoc main_~check__tmp~61#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20679: havoc main_~node7____CPAchecker_TMP_0~63#1;havoc main_~node7__m7~126#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10374: havoc main_~node6____CPAchecker_TMP_0~5#1;havoc main_~node6__m6~37#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17246: havoc main_~node6____CPAchecker_TMP_0~23#1;havoc main_~node6__m6~55#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L864: havoc main_~node7__m7~2#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7208: havoc main_~node7__m7~49#1; [2025-03-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13022: havoc main_~node6____CPAchecker_TMP_0~12#1;havoc main_~node6__m6~44#1; [2025-03-16 19:36:29,723 INFO L1322 $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-16 19:36:29,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3510: havoc main_~node4__m4~4#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9589: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3778: havoc main_~check__tmp~31#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1401: havoc main_~node7__m7~3#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194: havoc main_~node6__m6~5#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16464: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-16 19:36:29,725 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18051: havoc main_~node7____CPAchecker_TMP_0~49#1;havoc main_~node7__m7~112#1; [2025-03-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2460: havoc main_~node4__m4~3#1; [2025-03-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10391: havoc main_~node7____CPAchecker_TMP_0~9#1;havoc main_~node7__m7~72#1; [2025-03-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6428: havoc main_~node7__m7~41#1; [2025-03-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17263: havoc main_~node7____CPAchecker_TMP_0~45#1;havoc main_~node7__m7~108#1; [2025-03-16 19:36:29,726 INFO L1322 $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-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730: havoc main_~check__tmp~20#1; [2025-03-16 19:36:29,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4581: havoc main_~node4__m4~5#1; [2025-03-16 19:36:29,726 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18587: havoc main_~node7____CPAchecker_TMP_0~52#1;havoc main_~node7__m7~115#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3525: havoc main_~node5__m5~6#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13039: havoc main_~node7____CPAchecker_TMP_0~23#1;havoc main_~node7__m7~86#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8283: havoc main_~check__tmp~65#1;havoc main_~node7__m7~58#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10927: havoc main_~node7____CPAchecker_TMP_0~12#1;havoc main_~node7__m7~75#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9606: havoc main_~node6____CPAchecker_TMP_0~3#1;havoc main_~node6__m6~35#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14363: havoc main_~node7____CPAchecker_TMP_0~30#1;havoc main_~node7__m7~93#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17799: havoc main_~node7____CPAchecker_TMP_0~48#1;havoc main_~node7__m7~111#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19914: havoc main_~node6____CPAchecker_TMP_0~30#1;havoc main_~node6__m6~62#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2209: havoc main_~node7__m7~8#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2475: havoc main_~node5__m5~4#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16481: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4854: havoc main_~node6__m6~15#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6969: havoc main_~node5__m5~13#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5121: havoc main_~check__tmp~43#1;havoc main_~node7__m7~30#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8028: havoc main_~node6__m6~29#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L631: havoc main_~node2__m2~1#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4596: havoc main_~node5__m5~8#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3540: havoc main_~node6__m6~10#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15171: havoc main_~node7____CPAchecker_TMP_0~34#1;havoc main_~node7__m7~97#1; [2025-03-16 19:36:29,727 INFO L1322 $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-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9623: havoc main_~node7____CPAchecker_TMP_0~5#1;havoc main_~node7__m7~68#1; [2025-03-16 19:36:29,727 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3281: havoc main_~node6__m6~9#1; [2025-03-16 19:36:29,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~node6__m6~6#1; [2025-03-16 19:36:29,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19931: havoc main_~node7____CPAchecker_TMP_0~59#1;havoc main_~node7__m7~122#1; [2025-03-16 19:36:29,728 INFO L1322 $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-16 19:36:29,728 INFO L1322 $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-16 19:36:29,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6984: havoc main_~node6__m6~24#1; [2025-03-16 19:36:29,728 INFO L1322 $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-16 19:36:29,730 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16498: havoc main_~node6____CPAchecker_TMP_0~21#1;havoc main_~node6__m6~53#1; [2025-03-16 19:36:29,730 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1172: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,730 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8043: havoc main_~node7__m7~56#1; [2025-03-16 19:36:29,730 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14914: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-16 19:36:29,730 INFO L1322 $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-16 19:36:29,730 INFO L1322 $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-16 19:36:29,730 INFO L1322 $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-16 19:36:29,730 INFO L1322 $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-16 19:36:29,730 INFO L1322 $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-16 19:36:29,730 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10159: havoc main_~node7____CPAchecker_TMP_0~8#1;havoc main_~node7__m7~71#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L646: havoc main_~node3__m3~1#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6724: havoc main_~check__tmp~57#1;havoc main_~node7__m7~43#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12274: havoc main_~node6____CPAchecker_TMP_0~10#1;havoc main_~node6__m6~42#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4611: havoc main_~node6__m6~14#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19146: havoc main_~node6____CPAchecker_TMP_0~28#1;havoc main_~node6__m6~60#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3555: havoc main_~node7__m7~18#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6199: havoc main_~check__tmp~52#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15713: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5936: havoc main_~check__tmp~49#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11486: havoc main_~node6____CPAchecker_TMP_0~8#1;havoc main_~node6__m6~40#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2505: havoc main_~node7__m7~10#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4355: havoc main_~node6__m6~13#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: havoc main_~node5__m5~5#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16515: havoc main_~node7____CPAchecker_TMP_0~41#1;havoc main_~node7__m7~104#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14931: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node4__m4~1#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4097: havoc main_~node5__m5~7#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4626: havoc main_~node7__m7~26#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc main_~check__tmp~62#1;havoc main_~node7__m7~51#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12291: havoc main_~node7____CPAchecker_TMP_0~19#1;havoc main_~node7__m7~82#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8592: havoc main_~node5__m5~17#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3836: havoc main_~node6__m6~11#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19163: havoc main_~node7____CPAchecker_TMP_0~55#1;havoc main_~node7__m7~118#1; [2025-03-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13615: havoc main_~node7____CPAchecker_TMP_0~26#1;havoc main_~node7__m7~89#1; [2025-03-16 19:36:29,731 INFO L1322 $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-16 19:36:29,731 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15730: havoc main_~node6____CPAchecker_TMP_0~19#1;havoc main_~node6__m6~51#1; [2025-03-16 19:36:29,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17051: havoc main_~node7____CPAchecker_TMP_0~44#1;havoc main_~node7__m7~107#1; [2025-03-16 19:36:29,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20487: havoc main_~node7____CPAchecker_TMP_0~62#1;havoc main_~node7__m7~125#1; [2025-03-16 19:36:29,732 INFO L1322 $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-16 19:36:29,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11503: havoc main_~node7____CPAchecker_TMP_0~15#1;havoc main_~node7__m7~78#1; [2025-03-16 19:36:29,732 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726: havoc main_~node7__m7~5#1; [2025-03-16 19:36:29,734 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4898: havoc main_~check__tmp~42#1;havoc main_~node7__m7~28#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3051: havoc main_~node6__m6~8#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2788: havoc main_~node6__m6~7#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L676: havoc main_~node5__m5~1#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4112: havoc main_~node6__m6~12#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14948: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8607: havoc main_~node6__m6~32#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14157: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3851: havoc main_~node7__m7~20#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8346: havoc main_~node7__m7~59#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3325: havoc main_~check__tmp~27#1;havoc main_~node7__m7~16#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15747: havoc main_~node7____CPAchecker_TMP_0~37#1;havoc main_~node7__m7~100#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~node7__m7~35#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7028: havoc main_~check__tmp~59#1;havoc main_~node7__m7~46#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3066: havoc main_~node7__m7~14#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7823: havoc main_~node5__m5~15#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2803: havoc main_~node7__m7~12#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9411: havoc main_~node7____CPAchecker_TMP_0~4#1;havoc main_~node7__m7~67#1; [2025-03-16 19:36:29,735 INFO L1322 $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-16 19:36:29,735 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node6__m6~1#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12847: havoc main_~node7____CPAchecker_TMP_0~22#1;havoc main_~node7__m7~85#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16283: havoc main_~node7____CPAchecker_TMP_0~40#1;havoc main_~node7__m7~103#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4127: havoc main_~node7__m7~22#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5184: havoc main_~node7__m7~31#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18398: havoc main_~node6____CPAchecker_TMP_0~26#1;havoc main_~node6__m6~58#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8622: havoc main_~node7__m7~62#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14965: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10738: havoc main_~node6____CPAchecker_TMP_0~6#1;havoc main_~node6__m6~38#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14174: havoc main_~node6____CPAchecker_TMP_0~15#1;havoc main_~node6__m6~47#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17610: havoc main_~node6____CPAchecker_TMP_0~24#1;havoc main_~node6__m6~56#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc main_~check__tmp~38#1;havoc main_~node7__m7~24#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288: havoc main_~check__tmp~15#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7838: havoc main_~node6__m6~28#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node7__m7~1#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13392: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8108: havoc main_~node7__m7~57#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18415: havoc main_~node7____CPAchecker_TMP_0~51#1;havoc main_~node7__m7~114#1; [2025-03-16 19:36:29,736 INFO L1322 $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-16 19:36:29,736 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14982: havoc main_~node6____CPAchecker_TMP_0~17#1;havoc main_~node6__m6~49#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19739: havoc main_~node7____CPAchecker_TMP_0~58#1;havoc main_~node7__m7~121#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6791: havoc main_~node6__m6~23#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10755: havoc main_~node7____CPAchecker_TMP_0~11#1;havoc main_~node7__m7~74#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14191: havoc main_~node7____CPAchecker_TMP_0~29#1;havoc main_~node7__m7~92#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L17627: havoc main_~node7____CPAchecker_TMP_0~47#1;havoc main_~node7__m7~110#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6531: havoc main_~node4__m4~7#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6268: havoc main_~check__tmp~53#1;havoc main_~node7__m7~39#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6005: havoc main_~check__tmp~50#1;havoc main_~node7__m7~37#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7327: havoc main_~node3__m3~5#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9970: havoc main_~node6____CPAchecker_TMP_0~4#1;havoc main_~node6__m6~36#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14727: havoc main_~node7____CPAchecker_TMP_0~32#1;havoc main_~node7__m7~95#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13409: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20281: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5484: havoc main_~node2__m2~3#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L992: havoc main_~node7____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L14999: havoc main_~node7____CPAchecker_TMP_0~33#1;havoc main_~node7__m7~96#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3374: havoc main_~node7__m7~17#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6546: havoc main_~node5__m5~12#1; [2025-03-16 19:36:29,737 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4961: havoc main_~node7__m7~29#1; [2025-03-16 19:36:29,737 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7077: havoc main_~node7__m7~47#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7342: havoc main_~node4__m4~8#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057: havoc main_~node7__m7~7#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12099: havoc main_~node7____CPAchecker_TMP_0~18#1;havoc main_~node7__m7~81#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L15535: havoc main_~node7____CPAchecker_TMP_0~36#1;havoc main_~node7__m7~99#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L18971: havoc main_~node7____CPAchecker_TMP_0~54#1;havoc main_~node7__m7~117#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9987: havoc main_~node7____CPAchecker_TMP_0~7#1;havoc main_~node7__m7~70#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4704: havoc main_~check__tmp~40#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11311: havoc main_~node7____CPAchecker_TMP_0~14#1;havoc main_~node7__m7~77#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13426: havoc main_~node6____CPAchecker_TMP_0~13#1;havoc main_~node6__m6~45#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5499: havoc main_~node3__m3~4#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16862: havoc main_~node6____CPAchecker_TMP_0~22#1;havoc main_~node6__m6~54#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20298: havoc main_~node6____CPAchecker_TMP_0~31#1;havoc main_~node6__m6~63#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7615: havoc main_~node6__m6~27#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7882: havoc main_~check__tmp~64#1;havoc main_~node7__m7~54#1; [2025-03-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6561: havoc main_~node6__m6~22#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,738 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~check__tmp~9#1; [2025-03-16 19:36:29,738 INFO L1322 $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-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L12641: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7357: havoc main_~node5__m5~14#1; [2025-03-16 19:36:29,740 INFO L1322 $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-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L19516: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6835: havoc main_~check__tmp~58#1;havoc main_~node7__m7~44#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5514: havoc main_~node4__m4~6#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3929: havoc main_~check__tmp~33#1; [2025-03-16 19:36:29,740 INFO L1322 $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-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L13443: havoc main_~node7____CPAchecker_TMP_0~25#1;havoc main_~node7__m7~88#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L16879: havoc main_~node7____CPAchecker_TMP_0~43#1;havoc main_~node7__m7~106#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8687: havoc main_~node7__m7~63#1; [2025-03-16 19:36:29,740 INFO L1322 $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-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L11859: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-16 19:36:29,740 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L20315: havoc main_~node7____CPAchecker_TMP_0~61#1;havoc main_~node7__m7~124#1; [2025-03-16 19:36:30,122 INFO L? ?]: Removed 2124 outVars from TransFormulas that were not future-live. [2025-03-16 19:36:30,123 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:36:30,166 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:36:30,166 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:36:30,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:30 BoogieIcfgContainer [2025-03-16 19:36:30,167 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:36:30,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:36:30,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:36:30,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:36:30,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:36:22" (1/3) ... [2025-03-16 19:36:30,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e5b21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:30, skipping insertion in model container [2025-03-16 19:36:30,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:36:24" (2/3) ... [2025-03-16 19:36:30,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e5b21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:36:30, skipping insertion in model container [2025-03-16 19:36:30,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:36:30" (3/3) ... [2025-03-16 19:36:30,176 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2025-03-16 19:36:30,186 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:36:30,189 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, 2081 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-03-16 19:36:30,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:36:30,297 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;@3d170de6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:36:30,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-16 19:36:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 2081 states, 2051 states have (on average 1.8610433934666017) internal successors, (3817), 2080 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 19:36:30,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:30,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:30,331 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-16 19:36:30,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1040277504, now seen corresponding path program 1 times [2025-03-16 19:36:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490568758] [2025-03-16 19:36:30,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 19:36:30,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 19:36:30,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490568758] [2025-03-16 19:36:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490568758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:30,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251587228] [2025-03-16 19:36:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:30,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:30,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:30,991 INFO L87 Difference]: Start difference. First operand has 2081 states, 2051 states have (on average 1.8610433934666017) internal successors, (3817), 2080 states have internal predecessors, (3817), 0 states have call successors, (0), 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.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:32,058 INFO L93 Difference]: Finished difference Result 3094 states and 5491 transitions. [2025-03-16 19:36:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:32,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 19:36:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:32,081 INFO L225 Difference]: With dead ends: 3094 [2025-03-16 19:36:32,082 INFO L226 Difference]: Without dead ends: 1590 [2025-03-16 19:36:32,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:32,093 INFO L435 NwaCegarLoop]: 1853 mSDtfsCounter, 8280 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8280 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:32,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8280 Valid, 1915 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:36:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2025-03-16 19:36:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1590. [2025-03-16 19:36:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1561 states have (on average 1.32222934016656) internal successors, (2064), 1589 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2064 transitions. [2025-03-16 19:36:32,184 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2064 transitions. Word has length 100 [2025-03-16 19:36:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:32,184 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2064 transitions. [2025-03-16 19:36:32,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2064 transitions. [2025-03-16 19:36:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:36:32,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:32,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:32,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:36:32,190 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-16 19:36:32,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash -424420080, now seen corresponding path program 1 times [2025-03-16 19:36:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92696873] [2025-03-16 19:36:32,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:32,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:36:32,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:36:32,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:32,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:32,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-16 19:36:32,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:32,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92696873] [2025-03-16 19:36:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92696873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:32,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560667322] [2025-03-16 19:36:32,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:32,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:32,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:32,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:32,446 INFO L87 Difference]: Start difference. First operand 1590 states and 2064 transitions. 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-16 19:36:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:33,362 INFO L93 Difference]: Finished difference Result 3180 states and 4289 transitions. [2025-03-16 19:36:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:33,363 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-16 19:36:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:33,369 INFO L225 Difference]: With dead ends: 3180 [2025-03-16 19:36:33,369 INFO L226 Difference]: Without dead ends: 1911 [2025-03-16 19:36:33,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:33,371 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 6854 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6854 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:33,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6854 Valid, 1468 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:36:33,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-16 19:36:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1809. [2025-03-16 19:36:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1780 states have (on average 1.400561797752809) internal successors, (2493), 1808 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2493 transitions. [2025-03-16 19:36:33,413 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2493 transitions. Word has length 101 [2025-03-16 19:36:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2493 transitions. [2025-03-16 19:36:33,414 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-16 19:36:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2493 transitions. [2025-03-16 19:36:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:36:33,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:33,417 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:33,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:36:33,417 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-16 19:36:33,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:33,418 INFO L85 PathProgramCache]: Analyzing trace with hash -90116344, now seen corresponding path program 1 times [2025-03-16 19:36:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532264187] [2025-03-16 19:36:33,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:33,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:33,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:36:33,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:36:33,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:33,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:33,597 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-16 19:36:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:33,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532264187] [2025-03-16 19:36:33,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532264187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:33,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458772828] [2025-03-16 19:36:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:33,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:33,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:33,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:33,600 INFO L87 Difference]: Start difference. First operand 1809 states and 2493 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-16 19:36:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:34,165 INFO L93 Difference]: Finished difference Result 3297 states and 4634 transitions. [2025-03-16 19:36:34,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:34,166 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-16 19:36:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:34,170 INFO L225 Difference]: With dead ends: 3297 [2025-03-16 19:36:34,170 INFO L226 Difference]: Without dead ends: 1678 [2025-03-16 19:36:34,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:34,172 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 4783 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4783 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:34,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4783 Valid, 926 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2025-03-16 19:36:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2025-03-16 19:36:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1649 states have (on average 1.4214675560946028) internal successors, (2344), 1677 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2344 transitions. [2025-03-16 19:36:34,197 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2344 transitions. Word has length 102 [2025-03-16 19:36:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:34,197 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2344 transitions. [2025-03-16 19:36:34,197 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-16 19:36:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2344 transitions. [2025-03-16 19:36:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 19:36:34,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:34,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:34,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:36:34,201 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-16 19:36:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1323687656, now seen corresponding path program 1 times [2025-03-16 19:36:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157998193] [2025-03-16 19:36:34,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 19:36:34,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 19:36:34,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:34,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:34,411 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-16 19:36:34,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:34,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157998193] [2025-03-16 19:36:34,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157998193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:34,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:34,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115766119] [2025-03-16 19:36:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:34,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:34,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:34,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:34,414 INFO L87 Difference]: Start difference. First operand 1678 states and 2344 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-16 19:36:35,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:35,141 INFO L93 Difference]: Finished difference Result 3166 states and 4483 transitions. [2025-03-16 19:36:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:35,141 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-16 19:36:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:35,147 INFO L225 Difference]: With dead ends: 3166 [2025-03-16 19:36:35,147 INFO L226 Difference]: Without dead ends: 1638 [2025-03-16 19:36:35,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:35,151 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 4523 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4523 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:35,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4523 Valid, 712 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:36:35,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2025-03-16 19:36:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2025-03-16 19:36:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1609 states have (on average 1.4257302672467371) internal successors, (2294), 1637 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2294 transitions. [2025-03-16 19:36:35,172 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2294 transitions. Word has length 103 [2025-03-16 19:36:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:35,172 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2294 transitions. [2025-03-16 19:36:35,172 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-16 19:36:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2294 transitions. [2025-03-16 19:36:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 19:36:35,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:35,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:35,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:36:35,175 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-16 19:36:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash 480723728, now seen corresponding path program 1 times [2025-03-16 19:36:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220741303] [2025-03-16 19:36:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:35,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 19:36:35,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 19:36:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:35,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:35,321 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-16 19:36:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220741303] [2025-03-16 19:36:35,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220741303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:35,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:35,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:35,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561987008] [2025-03-16 19:36:35,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:35,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:35,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:35,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:35,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:35,323 INFO L87 Difference]: Start difference. First operand 1638 states and 2294 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-16 19:36:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:35,880 INFO L93 Difference]: Finished difference Result 3126 states and 4431 transitions. [2025-03-16 19:36:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:35,880 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-16 19:36:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:35,884 INFO L225 Difference]: With dead ends: 3126 [2025-03-16 19:36:35,884 INFO L226 Difference]: Without dead ends: 1606 [2025-03-16 19:36:35,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:35,886 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 4453 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4453 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:35,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4453 Valid, 803 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-16 19:36:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-16 19:36:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1577 states have (on average 1.4305643627140139) internal successors, (2256), 1605 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2256 transitions. [2025-03-16 19:36:35,906 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2256 transitions. Word has length 104 [2025-03-16 19:36:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:35,907 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2256 transitions. [2025-03-16 19:36:35,907 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-16 19:36:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2256 transitions. [2025-03-16 19:36:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 19:36:35,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:35,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:36:35,910 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-16 19:36:35,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1759302368, now seen corresponding path program 1 times [2025-03-16 19:36:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:35,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464619646] [2025-03-16 19:36:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:35,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 19:36:35,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 19:36:35,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:35,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:36,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464619646] [2025-03-16 19:36:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464619646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416985105] [2025-03-16 19:36:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:36,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:36,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:36,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:36,037 INFO L87 Difference]: Start difference. First operand 1606 states and 2256 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-16 19:36:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:36,495 INFO L93 Difference]: Finished difference Result 3094 states and 4391 transitions. [2025-03-16 19:36:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:36,495 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-16 19:36:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:36,499 INFO L225 Difference]: With dead ends: 3094 [2025-03-16 19:36:36,499 INFO L226 Difference]: Without dead ends: 1578 [2025-03-16 19:36:36,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:36,500 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 4419 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4419 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:36,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4419 Valid, 848 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:36:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2025-03-16 19:36:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2025-03-16 19:36:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1549 states have (on average 1.435765009683667) internal successors, (2224), 1577 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2224 transitions. [2025-03-16 19:36:36,548 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2224 transitions. Word has length 105 [2025-03-16 19:36:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2224 transitions. [2025-03-16 19:36:36,548 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-16 19:36:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2224 transitions. [2025-03-16 19:36:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 19:36:36,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:36,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:36,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:36:36,550 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-16 19:36:36,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:36,551 INFO L85 PathProgramCache]: Analyzing trace with hash 35736792, now seen corresponding path program 1 times [2025-03-16 19:36:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:36,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830038117] [2025-03-16 19:36:36,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:36,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 19:36:36,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 19:36:36,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:36,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:36,667 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-16 19:36:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830038117] [2025-03-16 19:36:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830038117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:36:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338573538] [2025-03-16 19:36:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:36,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:36:36,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:36,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:36:36,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:36:36,669 INFO L87 Difference]: Start difference. First operand 1578 states and 2224 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-16 19:36:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:37,233 INFO L93 Difference]: Finished difference Result 3066 states and 4357 transitions. [2025-03-16 19:36:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:36:37,233 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-16 19:36:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:37,237 INFO L225 Difference]: With dead ends: 3066 [2025-03-16 19:36:37,237 INFO L226 Difference]: Without dead ends: 1567 [2025-03-16 19:36:37,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:37,239 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 4346 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4346 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:37,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4346 Valid, 821 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:36:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2025-03-16 19:36:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2025-03-16 19:36:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.436931079323797) internal successors, (2210), 1566 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-16 19:36:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2210 transitions. [2025-03-16 19:36:37,262 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2210 transitions. Word has length 106 [2025-03-16 19:36:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:37,262 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2210 transitions. [2025-03-16 19:36:37,263 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-16 19:36:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2210 transitions. [2025-03-16 19:36:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:36:37,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:37,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:37,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:36:37,265 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-16 19:36:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1096824040, now seen corresponding path program 1 times [2025-03-16 19:36:37,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:37,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414797757] [2025-03-16 19:36:37,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:37,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:36:37,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:36:37,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:37,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:37,642 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-16 19:36:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:37,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414797757] [2025-03-16 19:36:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414797757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:37,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:37,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:36:37,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304812898] [2025-03-16 19:36:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:37,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:36:37,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:37,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:36:37,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:36:37,643 INFO L87 Difference]: Start difference. First operand 1567 states and 2210 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 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-16 19:36:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:38,978 INFO L93 Difference]: Finished difference Result 2719 states and 3699 transitions. [2025-03-16 19:36:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:36:38,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 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-16 19:36:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:38,983 INFO L225 Difference]: With dead ends: 2719 [2025-03-16 19:36:38,983 INFO L226 Difference]: Without dead ends: 2050 [2025-03-16 19:36:38,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:36:38,985 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 4197 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:38,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 2791 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3105 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:36:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-03-16 19:36:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1567. [2025-03-16 19:36:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4362808842652797) internal successors, (2209), 1566 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-16 19:36:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2209 transitions. [2025-03-16 19:36:39,013 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2209 transitions. Word has length 107 [2025-03-16 19:36:39,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:39,014 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2209 transitions. [2025-03-16 19:36:39,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 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-16 19:36:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2209 transitions. [2025-03-16 19:36:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:36:39,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:39,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:36:39,016 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-16 19:36:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1110776423, now seen corresponding path program 1 times [2025-03-16 19:36:39,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:39,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808041197] [2025-03-16 19:36:39,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:39,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:39,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:36:39,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:36:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:39,370 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-16 19:36:39,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:39,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808041197] [2025-03-16 19:36:39,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808041197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:39,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:39,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:39,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144408562] [2025-03-16 19:36:39,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:39,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:39,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:39,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:39,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:39,371 INFO L87 Difference]: Start difference. First operand 1567 states and 2209 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:40,674 INFO L93 Difference]: Finished difference Result 2049 states and 2905 transitions. [2025-03-16 19:36:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:36:40,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:40,678 INFO L225 Difference]: With dead ends: 2049 [2025-03-16 19:36:40,678 INFO L226 Difference]: Without dead ends: 1657 [2025-03-16 19:36:40,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:40,679 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 2459 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 3386 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2459 SdHoareTripleChecker+Valid, 4859 SdHoareTripleChecker+Invalid, 3390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:40,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2459 Valid, 4859 Invalid, 3390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3386 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:36:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-16 19:36:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1567. [2025-03-16 19:36:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.435630689206762) internal successors, (2208), 1566 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-16 19:36:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2208 transitions. [2025-03-16 19:36:40,695 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2208 transitions. Word has length 107 [2025-03-16 19:36:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:40,695 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2208 transitions. [2025-03-16 19:36:40,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2208 transitions. [2025-03-16 19:36:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 19:36:40,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:40,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:40,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:36:40,697 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-16 19:36:40,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1474920825, now seen corresponding path program 1 times [2025-03-16 19:36:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:40,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103650205] [2025-03-16 19:36:40,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:40,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:40,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 19:36:40,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 19:36:40,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:40,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:40,967 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-16 19:36:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103650205] [2025-03-16 19:36:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103650205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724992916] [2025-03-16 19:36:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:40,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:40,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:40,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:40,969 INFO L87 Difference]: Start difference. First operand 1567 states and 2208 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:42,176 INFO L93 Difference]: Finished difference Result 2640 states and 3727 transitions. [2025-03-16 19:36:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:36:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:42,181 INFO L225 Difference]: With dead ends: 2640 [2025-03-16 19:36:42,181 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 19:36:42,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:42,182 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 6085 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 2960 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6085 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:42,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6085 Valid, 3622 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2960 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 19:36:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2025-03-16 19:36:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4349804941482445) internal successors, (2207), 1566 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-16 19:36:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2207 transitions. [2025-03-16 19:36:42,200 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2207 transitions. Word has length 107 [2025-03-16 19:36:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:42,200 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2207 transitions. [2025-03-16 19:36:42,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 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-16 19:36:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2207 transitions. [2025-03-16 19:36:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:42,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:42,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:42,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:36:42,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2040419623, now seen corresponding path program 1 times [2025-03-16 19:36:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280801708] [2025-03-16 19:36:42,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:42,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:42,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:42,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:42,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:42,488 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-16 19:36:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280801708] [2025-03-16 19:36:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280801708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:42,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:42,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:42,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716235153] [2025-03-16 19:36:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:42,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:42,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:42,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:42,489 INFO L87 Difference]: Start difference. First operand 1567 states and 2207 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:43,876 INFO L93 Difference]: Finished difference Result 2720 states and 3850 transitions. [2025-03-16 19:36:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:36:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:43,881 INFO L225 Difference]: With dead ends: 2720 [2025-03-16 19:36:43,881 INFO L226 Difference]: Without dead ends: 2452 [2025-03-16 19:36:43,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:43,882 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 4496 mSDsluCounter, 4277 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4496 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 4072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:43,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4496 Valid, 5414 Invalid, 4072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:36:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-16 19:36:43,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2025-03-16 19:36:43,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4343302990897269) internal successors, (2206), 1566 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-16 19:36:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2206 transitions. [2025-03-16 19:36:43,900 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2206 transitions. Word has length 109 [2025-03-16 19:36:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:43,900 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2206 transitions. [2025-03-16 19:36:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2206 transitions. [2025-03-16 19:36:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:43,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:43,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:36:43,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:43,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:43,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1854525115, now seen corresponding path program 1 times [2025-03-16 19:36:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270093548] [2025-03-16 19:36:43,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:43,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:43,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:43,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:44,121 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-16 19:36:44,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:44,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270093548] [2025-03-16 19:36:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270093548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:44,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949632108] [2025-03-16 19:36:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:44,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:44,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:44,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:44,122 INFO L87 Difference]: Start difference. First operand 1567 states and 2206 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:45,341 INFO L93 Difference]: Finished difference Result 2586 states and 3642 transitions. [2025-03-16 19:36:45,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:36:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:45,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:45,346 INFO L225 Difference]: With dead ends: 2586 [2025-03-16 19:36:45,346 INFO L226 Difference]: Without dead ends: 2396 [2025-03-16 19:36:45,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:45,347 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 3784 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:45,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3784 Valid, 3707 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-03-16 19:36:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2025-03-16 19:36:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4336801040312093) internal successors, (2205), 1566 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-16 19:36:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2205 transitions. [2025-03-16 19:36:45,367 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2205 transitions. Word has length 109 [2025-03-16 19:36:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:45,367 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2205 transitions. [2025-03-16 19:36:45,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2205 transitions. [2025-03-16 19:36:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:45,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:45,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:45,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:36:45,370 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-16 19:36:45,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1249549639, now seen corresponding path program 1 times [2025-03-16 19:36:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:45,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143470206] [2025-03-16 19:36:45,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:45,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:45,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:45,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:45,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:45,583 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-16 19:36:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143470206] [2025-03-16 19:36:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143470206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797987830] [2025-03-16 19:36:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:45,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:45,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:45,584 INFO L87 Difference]: Start difference. First operand 1567 states and 2205 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:46,900 INFO L93 Difference]: Finished difference Result 2741 states and 3870 transitions. [2025-03-16 19:36:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:36:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:46,905 INFO L225 Difference]: With dead ends: 2741 [2025-03-16 19:36:46,905 INFO L226 Difference]: Without dead ends: 2452 [2025-03-16 19:36:46,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:46,906 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 5280 mSDsluCounter, 3485 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5280 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 3704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:46,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5280 Valid, 4528 Invalid, 3704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:36:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-16 19:36:46,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2025-03-16 19:36:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.433029908972692) internal successors, (2204), 1566 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-16 19:36:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2204 transitions. [2025-03-16 19:36:46,928 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2204 transitions. Word has length 109 [2025-03-16 19:36:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:46,928 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2204 transitions. [2025-03-16 19:36:46,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2204 transitions. [2025-03-16 19:36:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:46,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:46,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:36:46,931 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-16 19:36:46,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 950258711, now seen corresponding path program 1 times [2025-03-16 19:36:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005658390] [2025-03-16 19:36:46,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:46,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:46,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:46,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:46,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:47,246 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-16 19:36:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:47,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005658390] [2025-03-16 19:36:47,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005658390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:47,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:47,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:47,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980621559] [2025-03-16 19:36:47,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:47,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:47,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:47,247 INFO L87 Difference]: Start difference. First operand 1567 states and 2204 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:48,507 INFO L93 Difference]: Finished difference Result 2640 states and 3723 transitions. [2025-03-16 19:36:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:36:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:48,513 INFO L225 Difference]: With dead ends: 2640 [2025-03-16 19:36:48,513 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 19:36:48,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:48,514 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 5460 mSDsluCounter, 3302 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5460 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:48,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5460 Valid, 4289 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 19:36:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2025-03-16 19:36:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4323797139141743) internal successors, (2203), 1566 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2203 transitions. [2025-03-16 19:36:48,532 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2203 transitions. Word has length 109 [2025-03-16 19:36:48,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:48,532 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2203 transitions. [2025-03-16 19:36:48,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:48,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2203 transitions. [2025-03-16 19:36:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:48,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:48,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:48,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:36:48,534 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-16 19:36:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1694246824, now seen corresponding path program 1 times [2025-03-16 19:36:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514879505] [2025-03-16 19:36:48,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:48,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:48,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:48,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:48,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:48,746 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-16 19:36:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:48,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514879505] [2025-03-16 19:36:48,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514879505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:48,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:48,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125254559] [2025-03-16 19:36:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:48,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:48,748 INFO L87 Difference]: Start difference. First operand 1567 states and 2203 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:49,862 INFO L93 Difference]: Finished difference Result 2313 states and 3262 transitions. [2025-03-16 19:36:49,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:36:49,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:49,866 INFO L225 Difference]: With dead ends: 2313 [2025-03-16 19:36:49,866 INFO L226 Difference]: Without dead ends: 1657 [2025-03-16 19:36:49,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:36:49,867 INFO L435 NwaCegarLoop]: 1123 mSDtfsCounter, 1646 mSDsluCounter, 3279 mSDsCounter, 0 mSdLazyCounter, 3008 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 4402 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:49,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 4402 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3008 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:36:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-03-16 19:36:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1567. [2025-03-16 19:36:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.431079323797139) internal successors, (2201), 1566 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2201 transitions. [2025-03-16 19:36:49,879 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2201 transitions. Word has length 109 [2025-03-16 19:36:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:49,879 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2201 transitions. [2025-03-16 19:36:49,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2201 transitions. [2025-03-16 19:36:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:49,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:49,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:36:49,881 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-16 19:36:49,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1606661207, now seen corresponding path program 1 times [2025-03-16 19:36:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102292902] [2025-03-16 19:36:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:49,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:49,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:49,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:49,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:36:50,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102292902] [2025-03-16 19:36:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102292902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594138021] [2025-03-16 19:36:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:50,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:50,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:50,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:50,096 INFO L87 Difference]: Start difference. First operand 1567 states and 2201 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:51,495 INFO L93 Difference]: Finished difference Result 2824 states and 3985 transitions. [2025-03-16 19:36:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:36:51,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:51,499 INFO L225 Difference]: With dead ends: 2824 [2025-03-16 19:36:51,499 INFO L226 Difference]: Without dead ends: 2452 [2025-03-16 19:36:51,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:36:51,500 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 3007 mSDsluCounter, 4912 mSDsCounter, 0 mSdLazyCounter, 4482 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3007 SdHoareTripleChecker+Valid, 6406 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:51,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3007 Valid, 6406 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4482 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:36:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-16 19:36:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2025-03-16 19:36:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4297789336801041) internal successors, (2199), 1566 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2199 transitions. [2025-03-16 19:36:51,513 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2199 transitions. Word has length 109 [2025-03-16 19:36:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:51,514 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2199 transitions. [2025-03-16 19:36:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2199 transitions. [2025-03-16 19:36:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 19:36:51,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:51,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:36:51,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:36:51,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -488497739, now seen corresponding path program 1 times [2025-03-16 19:36:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181064008] [2025-03-16 19:36:51,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:51,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 19:36:51,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 19:36:51,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:51,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:51,716 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-16 19:36:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181064008] [2025-03-16 19:36:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181064008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616774954] [2025-03-16 19:36:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:51,717 INFO L87 Difference]: Start difference. First operand 1567 states and 2199 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:53,000 INFO L93 Difference]: Finished difference Result 2684 states and 3782 transitions. [2025-03-16 19:36:53,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:36:53,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-03-16 19:36:53,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:53,004 INFO L225 Difference]: With dead ends: 2684 [2025-03-16 19:36:53,004 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 19:36:53,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:36:53,005 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 5128 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 3778 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5128 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 3782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:53,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5128 Valid, 4629 Invalid, 3782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:36:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 19:36:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2025-03-16 19:36:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.428478543563069) internal successors, (2197), 1566 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2197 transitions. [2025-03-16 19:36:53,018 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2197 transitions. Word has length 109 [2025-03-16 19:36:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:53,018 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2197 transitions. [2025-03-16 19:36:53,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2197 transitions. [2025-03-16 19:36:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:53,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:53,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:53,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:36:53,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:53,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:53,020 INFO L85 PathProgramCache]: Analyzing trace with hash 206889787, now seen corresponding path program 1 times [2025-03-16 19:36:53,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:53,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425238334] [2025-03-16 19:36:53,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:53,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:53,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:53,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:53,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:53,196 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-16 19:36:53,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425238334] [2025-03-16 19:36:53,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425238334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:53,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:53,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:53,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213275450] [2025-03-16 19:36:53,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:53,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:53,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:53,198 INFO L87 Difference]: Start difference. First operand 1567 states and 2197 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:54,293 INFO L93 Difference]: Finished difference Result 2526 states and 3531 transitions. [2025-03-16 19:36:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:36:54,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:36:54,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:54,296 INFO L225 Difference]: With dead ends: 2526 [2025-03-16 19:36:54,296 INFO L226 Difference]: Without dead ends: 2348 [2025-03-16 19:36:54,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:54,296 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 5988 mSDsluCounter, 2675 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5988 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:54,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5988 Valid, 3484 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:36:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-16 19:36:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2025-03-16 19:36:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4278283485045513) internal successors, (2196), 1566 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-16 19:36:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2196 transitions. [2025-03-16 19:36:54,308 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2196 transitions. Word has length 111 [2025-03-16 19:36:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:54,308 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2196 transitions. [2025-03-16 19:36:54,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2196 transitions. [2025-03-16 19:36:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:54,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:54,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:36:54,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:54,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash 436040908, now seen corresponding path program 1 times [2025-03-16 19:36:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:54,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274846596] [2025-03-16 19:36:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:54,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:54,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:54,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:54,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:54,518 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-16 19:36:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:54,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274846596] [2025-03-16 19:36:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274846596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:54,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088920798] [2025-03-16 19:36:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:54,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:54,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:54,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:54,521 INFO L87 Difference]: Start difference. First operand 1567 states and 2196 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:55,770 INFO L93 Difference]: Finished difference Result 2633 states and 3706 transitions. [2025-03-16 19:36:55,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:36:55,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:36:55,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:55,774 INFO L225 Difference]: With dead ends: 2633 [2025-03-16 19:36:55,774 INFO L226 Difference]: Without dead ends: 2420 [2025-03-16 19:36:55,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:36:55,775 INFO L435 NwaCegarLoop]: 1072 mSDtfsCounter, 5125 mSDsluCounter, 3557 mSDsCounter, 0 mSdLazyCounter, 3770 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5125 SdHoareTripleChecker+Valid, 4629 SdHoareTripleChecker+Invalid, 3774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:55,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5125 Valid, 4629 Invalid, 3774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3770 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-03-16 19:36:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 1567. [2025-03-16 19:36:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4271781534460337) internal successors, (2195), 1566 states have internal predecessors, (2195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2195 transitions. [2025-03-16 19:36:55,786 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2195 transitions. Word has length 111 [2025-03-16 19:36:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:55,786 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2195 transitions. [2025-03-16 19:36:55,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2195 transitions. [2025-03-16 19:36:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:55,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:55,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:36:55,787 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:55,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash -687880402, now seen corresponding path program 1 times [2025-03-16 19:36:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156978276] [2025-03-16 19:36:55,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:55,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:55,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:55,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:55,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:55,976 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-16 19:36:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156978276] [2025-03-16 19:36:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156978276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407777606] [2025-03-16 19:36:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:55,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:55,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:55,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:55,979 INFO L87 Difference]: Start difference. First operand 1567 states and 2195 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:57,143 INFO L93 Difference]: Finished difference Result 2584 states and 3627 transitions. [2025-03-16 19:36:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:36:57,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:36:57,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:57,146 INFO L225 Difference]: With dead ends: 2584 [2025-03-16 19:36:57,146 INFO L226 Difference]: Without dead ends: 2396 [2025-03-16 19:36:57,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:36:57,147 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 5486 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 3418 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5486 SdHoareTripleChecker+Valid, 4146 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:57,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5486 Valid, 4146 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3418 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:36:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-03-16 19:36:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1567. [2025-03-16 19:36:57,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4265279583875163) internal successors, (2194), 1566 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-16 19:36:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2194 transitions. [2025-03-16 19:36:57,160 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2194 transitions. Word has length 111 [2025-03-16 19:36:57,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:57,160 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2194 transitions. [2025-03-16 19:36:57,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:57,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2194 transitions. [2025-03-16 19:36:57,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:57,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:57,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:57,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:36:57,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:36:57,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:57,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1647929689, now seen corresponding path program 1 times [2025-03-16 19:36:57,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569341158] [2025-03-16 19:36:57,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:57,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:57,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:57,556 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-16 19:36:57,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569341158] [2025-03-16 19:36:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569341158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:36:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473637914] [2025-03-16 19:36:57,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:57,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:36:57,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:57,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:36:57,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:36:57,557 INFO L87 Difference]: Start difference. First operand 1567 states and 2194 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:36:59,267 INFO L93 Difference]: Finished difference Result 3175 states and 4484 transitions. [2025-03-16 19:36:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:36:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:36:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:36:59,271 INFO L225 Difference]: With dead ends: 3175 [2025-03-16 19:36:59,271 INFO L226 Difference]: Without dead ends: 2980 [2025-03-16 19:36:59,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:36:59,272 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 10366 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10366 SdHoareTripleChecker+Valid, 4483 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:36:59,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10366 Valid, 4483 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:36:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2025-03-16 19:36:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1571. [2025-03-16 19:36:59,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4254215304798963) internal successors, (2198), 1570 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-16 19:36:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2198 transitions. [2025-03-16 19:36:59,287 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2198 transitions. Word has length 111 [2025-03-16 19:36:59,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:36:59,287 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2198 transitions. [2025-03-16 19:36:59,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:36:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2198 transitions. [2025-03-16 19:36:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:36:59,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:36:59,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:36:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:36:59,289 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-16 19:36:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:36:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1865937163, now seen corresponding path program 1 times [2025-03-16 19:36:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:36:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473867218] [2025-03-16 19:36:59,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:36:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:36:59,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:36:59,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:36:59,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:36:59,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:36:59,473 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-16 19:36:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:36:59,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473867218] [2025-03-16 19:36:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473867218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:36:59,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:36:59,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:36:59,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155498108] [2025-03-16 19:36:59,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:36:59,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:36:59,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:36:59,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:36:59,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:36:59,475 INFO L87 Difference]: Start difference. First operand 1571 states and 2198 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:00,575 INFO L93 Difference]: Finished difference Result 2530 states and 3531 transitions. [2025-03-16 19:37:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:00,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:00,582 INFO L225 Difference]: With dead ends: 2530 [2025-03-16 19:37:00,582 INFO L226 Difference]: Without dead ends: 2352 [2025-03-16 19:37:00,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:00,583 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 3827 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3827 SdHoareTripleChecker+Valid, 3604 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:00,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3827 Valid, 3604 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-03-16 19:37:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 1571. [2025-03-16 19:37:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1542 states have (on average 1.4247730220492867) internal successors, (2197), 1570 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2197 transitions. [2025-03-16 19:37:00,598 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2197 transitions. Word has length 111 [2025-03-16 19:37:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2197 transitions. [2025-03-16 19:37:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2197 transitions. [2025-03-16 19:37:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:00,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:00,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:00,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:37:00,601 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:00,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:00,601 INFO L85 PathProgramCache]: Analyzing trace with hash 565421143, now seen corresponding path program 1 times [2025-03-16 19:37:00,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:00,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922612122] [2025-03-16 19:37:00,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:00,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:00,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:00,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:00,966 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-16 19:37:00,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:00,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922612122] [2025-03-16 19:37:00,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922612122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:00,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516435242] [2025-03-16 19:37:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:00,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:00,968 INFO L87 Difference]: Start difference. First operand 1571 states and 2197 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:02,905 INFO L93 Difference]: Finished difference Result 3175 states and 4483 transitions. [2025-03-16 19:37:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:02,907 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:02,912 INFO L225 Difference]: With dead ends: 3175 [2025-03-16 19:37:02,912 INFO L226 Difference]: Without dead ends: 2980 [2025-03-16 19:37:02,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:02,914 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 10416 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 4422 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10416 SdHoareTripleChecker+Valid, 5304 SdHoareTripleChecker+Invalid, 4787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 4422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:02,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10416 Valid, 5304 Invalid, 4787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 4422 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 19:37:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2025-03-16 19:37:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 1575. [2025-03-16 19:37:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.423673997412678) internal successors, (2201), 1574 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2201 transitions. [2025-03-16 19:37:02,934 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2201 transitions. Word has length 111 [2025-03-16 19:37:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:02,934 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2201 transitions. [2025-03-16 19:37:02,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2201 transitions. [2025-03-16 19:37:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:02,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:02,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:02,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:37:02,936 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-16 19:37:02,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:02,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1346788704, now seen corresponding path program 1 times [2025-03-16 19:37:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:02,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82876609] [2025-03-16 19:37:02,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:02,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:03,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82876609] [2025-03-16 19:37:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82876609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:03,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975834445] [2025-03-16 19:37:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:03,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:03,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:03,200 INFO L87 Difference]: Start difference. First operand 1575 states and 2201 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:04,607 INFO L93 Difference]: Finished difference Result 2586 states and 3625 transitions. [2025-03-16 19:37:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:04,611 INFO L225 Difference]: With dead ends: 2586 [2025-03-16 19:37:04,611 INFO L226 Difference]: Without dead ends: 2396 [2025-03-16 19:37:04,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:04,612 INFO L435 NwaCegarLoop]: 1009 mSDtfsCounter, 4517 mSDsluCounter, 3941 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 3854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:04,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 4950 Invalid, 3854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:37:04,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2025-03-16 19:37:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1575. [2025-03-16 19:37:04,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.423027166882277) internal successors, (2200), 1574 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-16 19:37:04,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2200 transitions. [2025-03-16 19:37:04,628 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2200 transitions. Word has length 111 [2025-03-16 19:37:04,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:04,628 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2200 transitions. [2025-03-16 19:37:04,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:04,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2200 transitions. [2025-03-16 19:37:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:04,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:04,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:04,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:37:04,630 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:04,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash 152371417, now seen corresponding path program 1 times [2025-03-16 19:37:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:04,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815382826] [2025-03-16 19:37:04,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:04,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:04,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:04,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:04,806 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-16 19:37:04,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:04,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815382826] [2025-03-16 19:37:04,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815382826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:04,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:04,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012583265] [2025-03-16 19:37:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:04,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:04,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:04,807 INFO L87 Difference]: Start difference. First operand 1575 states and 2200 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:05,901 INFO L93 Difference]: Finished difference Result 2543 states and 3540 transitions. [2025-03-16 19:37:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:05,903 INFO L225 Difference]: With dead ends: 2543 [2025-03-16 19:37:05,904 INFO L226 Difference]: Without dead ends: 2356 [2025-03-16 19:37:05,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:05,904 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 5829 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5829 SdHoareTripleChecker+Valid, 3668 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:05,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5829 Valid, 3668 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2025-03-16 19:37:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 1575. [2025-03-16 19:37:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4223803363518759) internal successors, (2199), 1574 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2199 transitions. [2025-03-16 19:37:05,917 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2199 transitions. Word has length 111 [2025-03-16 19:37:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:05,917 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2199 transitions. [2025-03-16 19:37:05,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2199 transitions. [2025-03-16 19:37:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:05,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:05,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] [2025-03-16 19:37:05,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:37:05,918 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:05,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:05,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2081644837, now seen corresponding path program 1 times [2025-03-16 19:37:05,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872457238] [2025-03-16 19:37:05,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:05,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:05,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:05,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:06,111 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-16 19:37:06,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872457238] [2025-03-16 19:37:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872457238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330079039] [2025-03-16 19:37:06,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:06,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:06,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:06,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:06,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:06,113 INFO L87 Difference]: Start difference. First operand 1575 states and 2199 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:07,265 INFO L93 Difference]: Finished difference Result 2443 states and 3369 transitions. [2025-03-16 19:37:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:07,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:07,267 INFO L225 Difference]: With dead ends: 2443 [2025-03-16 19:37:07,268 INFO L226 Difference]: Without dead ends: 2268 [2025-03-16 19:37:07,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:37:07,268 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 5987 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5987 SdHoareTripleChecker+Valid, 3267 SdHoareTripleChecker+Invalid, 2891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:07,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5987 Valid, 3267 Invalid, 2891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2268 states. [2025-03-16 19:37:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2268 to 1575. [2025-03-16 19:37:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.4217335058214748) internal successors, (2198), 1574 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-16 19:37:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2198 transitions. [2025-03-16 19:37:07,283 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2198 transitions. Word has length 111 [2025-03-16 19:37:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:07,284 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2198 transitions. [2025-03-16 19:37:07,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:07,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2198 transitions. [2025-03-16 19:37:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:07,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:07,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:07,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:37:07,286 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:07,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash 378792614, now seen corresponding path program 1 times [2025-03-16 19:37:07,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:07,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847792557] [2025-03-16 19:37:07,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:07,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:07,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:07,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:07,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847792557] [2025-03-16 19:37:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847792557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701015721] [2025-03-16 19:37:07,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:07,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:07,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:07,620 INFO L87 Difference]: Start difference. First operand 1575 states and 2198 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:09,555 INFO L93 Difference]: Finished difference Result 3330 states and 4701 transitions. [2025-03-16 19:37:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:09,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:09,558 INFO L225 Difference]: With dead ends: 3330 [2025-03-16 19:37:09,558 INFO L226 Difference]: Without dead ends: 3096 [2025-03-16 19:37:09,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:09,559 INFO L435 NwaCegarLoop]: 1115 mSDtfsCounter, 9172 mSDsluCounter, 4441 mSDsCounter, 0 mSdLazyCounter, 4609 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9172 SdHoareTripleChecker+Valid, 5556 SdHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 4609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:09,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9172 Valid, 5556 Invalid, 4934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 4609 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:37:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-16 19:37:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 1579. [2025-03-16 19:37:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1550 states have (on average 1.4206451612903226) internal successors, (2202), 1578 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-16 19:37:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2202 transitions. [2025-03-16 19:37:09,573 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2202 transitions. Word has length 111 [2025-03-16 19:37:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2202 transitions. [2025-03-16 19:37:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2202 transitions. [2025-03-16 19:37:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:09,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:09,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:37:09,574 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-16 19:37:09,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1411584936, now seen corresponding path program 1 times [2025-03-16 19:37:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032619594] [2025-03-16 19:37:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:09,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:09,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:09,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:09,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:09,764 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-16 19:37:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032619594] [2025-03-16 19:37:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032619594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:09,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:09,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091824209] [2025-03-16 19:37:09,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:09,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:09,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:09,766 INFO L87 Difference]: Start difference. First operand 1579 states and 2202 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:11,022 INFO L93 Difference]: Finished difference Result 2595 states and 3629 transitions. [2025-03-16 19:37:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:11,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:11,025 INFO L225 Difference]: With dead ends: 2595 [2025-03-16 19:37:11,025 INFO L226 Difference]: Without dead ends: 2400 [2025-03-16 19:37:11,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:11,026 INFO L435 NwaCegarLoop]: 1010 mSDtfsCounter, 3059 mSDsluCounter, 3946 mSDsCounter, 0 mSdLazyCounter, 3826 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 4956 SdHoareTripleChecker+Invalid, 3830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:11,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 4956 Invalid, 3830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3826 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2025-03-16 19:37:11,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1579. [2025-03-16 19:37:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1550 states have (on average 1.42) internal successors, (2201), 1578 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2201 transitions. [2025-03-16 19:37:11,038 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2201 transitions. Word has length 111 [2025-03-16 19:37:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:11,039 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2201 transitions. [2025-03-16 19:37:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2201 transitions. [2025-03-16 19:37:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:11,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:11,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:11,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:37:11,041 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:11,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:11,041 INFO L85 PathProgramCache]: Analyzing trace with hash 486873175, now seen corresponding path program 1 times [2025-03-16 19:37:11,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:11,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955436646] [2025-03-16 19:37:11,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:11,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:11,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:11,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:11,357 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-16 19:37:11,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955436646] [2025-03-16 19:37:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955436646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:11,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:11,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492578792] [2025-03-16 19:37:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:11,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:11,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:11,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:11,358 INFO L87 Difference]: Start difference. First operand 1579 states and 2201 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:13,066 INFO L93 Difference]: Finished difference Result 3364 states and 4749 transitions. [2025-03-16 19:37:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:13,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:13,069 INFO L225 Difference]: With dead ends: 3364 [2025-03-16 19:37:13,069 INFO L226 Difference]: Without dead ends: 3096 [2025-03-16 19:37:13,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:13,071 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 10263 mSDsluCounter, 3723 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10263 SdHoareTripleChecker+Valid, 4722 SdHoareTripleChecker+Invalid, 4214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:13,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10263 Valid, 4722 Invalid, 4214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 19:37:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-16 19:37:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 1587. [2025-03-16 19:37:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1558 states have (on average 1.4178433889602053) internal successors, (2209), 1586 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-16 19:37:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2209 transitions. [2025-03-16 19:37:13,086 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2209 transitions. Word has length 111 [2025-03-16 19:37:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2209 transitions. [2025-03-16 19:37:13,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2209 transitions. [2025-03-16 19:37:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:13,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:13,088 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:37:13,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1746086694, now seen corresponding path program 1 times [2025-03-16 19:37:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820205218] [2025-03-16 19:37:13,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:13,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:13,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:13,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:13,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:13,262 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-16 19:37:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820205218] [2025-03-16 19:37:13,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820205218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:13,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:13,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929118371] [2025-03-16 19:37:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:13,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:13,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:13,264 INFO L87 Difference]: Start difference. First operand 1587 states and 2209 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:14,358 INFO L93 Difference]: Finished difference Result 2556 states and 3551 transitions. [2025-03-16 19:37:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:14,360 INFO L225 Difference]: With dead ends: 2556 [2025-03-16 19:37:14,360 INFO L226 Difference]: Without dead ends: 2368 [2025-03-16 19:37:14,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:14,362 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 3746 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 3068 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3746 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 3072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:14,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3746 Valid, 3744 Invalid, 3072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3068 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-03-16 19:37:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1587. [2025-03-16 19:37:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1558 states have (on average 1.4165596919127086) internal successors, (2207), 1586 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-16 19:37:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2207 transitions. [2025-03-16 19:37:14,375 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2207 transitions. Word has length 111 [2025-03-16 19:37:14,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:14,375 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2207 transitions. [2025-03-16 19:37:14,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2207 transitions. [2025-03-16 19:37:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:14,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:14,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:14,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:37:14,377 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-16 19:37:14,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1681883283, now seen corresponding path program 1 times [2025-03-16 19:37:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159213505] [2025-03-16 19:37:14,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:14,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:14,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:14,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:14,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159213505] [2025-03-16 19:37:14,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159213505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:14,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:14,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127283306] [2025-03-16 19:37:14,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:14,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:14,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:14,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:14,554 INFO L87 Difference]: Start difference. First operand 1587 states and 2207 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:15,671 INFO L93 Difference]: Finished difference Result 2454 states and 3376 transitions. [2025-03-16 19:37:15,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:15,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:15,674 INFO L225 Difference]: With dead ends: 2454 [2025-03-16 19:37:15,674 INFO L226 Difference]: Without dead ends: 2280 [2025-03-16 19:37:15,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:15,675 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 5947 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5947 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:15,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5947 Valid, 3296 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2025-03-16 19:37:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1587. [2025-03-16 19:37:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1558 states have (on average 1.4152759948652118) internal successors, (2205), 1586 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-16 19:37:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2205 transitions. [2025-03-16 19:37:15,686 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2205 transitions. Word has length 111 [2025-03-16 19:37:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:15,686 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2205 transitions. [2025-03-16 19:37:15,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2205 transitions. [2025-03-16 19:37:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:15,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:15,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:15,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:37:15,687 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:15,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash 899922901, now seen corresponding path program 1 times [2025-03-16 19:37:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:15,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88641197] [2025-03-16 19:37:15,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:15,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:15,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:15,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:15,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:15,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:15,992 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-16 19:37:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88641197] [2025-03-16 19:37:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88641197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265578406] [2025-03-16 19:37:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:15,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:15,994 INFO L87 Difference]: Start difference. First operand 1587 states and 2205 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:17,624 INFO L93 Difference]: Finished difference Result 3206 states and 4511 transitions. [2025-03-16 19:37:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:17,624 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:17,627 INFO L225 Difference]: With dead ends: 3206 [2025-03-16 19:37:17,627 INFO L226 Difference]: Without dead ends: 2992 [2025-03-16 19:37:17,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:17,628 INFO L435 NwaCegarLoop]: 918 mSDtfsCounter, 10581 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 3557 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10581 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 3557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:17,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10581 Valid, 4350 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 3557 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:37:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2025-03-16 19:37:17,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1595. [2025-03-16 19:37:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1566 states have (on average 1.413154533844189) internal successors, (2213), 1594 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2213 transitions. [2025-03-16 19:37:17,644 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2213 transitions. Word has length 111 [2025-03-16 19:37:17,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:17,645 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2213 transitions. [2025-03-16 19:37:17,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2213 transitions. [2025-03-16 19:37:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:17,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:17,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:17,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:37:17,647 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2098832280, now seen corresponding path program 1 times [2025-03-16 19:37:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544257422] [2025-03-16 19:37:17,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:17,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:17,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:17,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:17,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:17,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:17,830 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-16 19:37:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:17,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544257422] [2025-03-16 19:37:17,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544257422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:17,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640362643] [2025-03-16 19:37:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:17,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:17,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:17,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:17,831 INFO L87 Difference]: Start difference. First operand 1595 states and 2213 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:18,935 INFO L93 Difference]: Finished difference Result 2642 states and 3677 transitions. [2025-03-16 19:37:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:18,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:18,937 INFO L225 Difference]: With dead ends: 2642 [2025-03-16 19:37:18,937 INFO L226 Difference]: Without dead ends: 2408 [2025-03-16 19:37:18,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:18,938 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 5657 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 3183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5657 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 3187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:18,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5657 Valid, 3931 Invalid, 3187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:18,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2025-03-16 19:37:18,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1595. [2025-03-16 19:37:18,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1566 states have (on average 1.4118773946360152) internal successors, (2211), 1594 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-16 19:37:18,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2211 transitions. [2025-03-16 19:37:18,949 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2211 transitions. Word has length 111 [2025-03-16 19:37:18,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:18,950 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2211 transitions. [2025-03-16 19:37:18,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:18,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2211 transitions. [2025-03-16 19:37:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:18,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:18,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:18,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:37:18,951 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:18,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:18,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1468649878, now seen corresponding path program 1 times [2025-03-16 19:37:18,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:18,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242512681] [2025-03-16 19:37:18,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:18,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:18,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:18,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:18,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:18,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:19,255 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-16 19:37:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242512681] [2025-03-16 19:37:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242512681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:19,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:19,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:37:19,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127167801] [2025-03-16 19:37:19,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:37:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:37:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:37:19,256 INFO L87 Difference]: Start difference. First operand 1595 states and 2211 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:21,375 INFO L93 Difference]: Finished difference Result 3656 states and 5149 transitions. [2025-03-16 19:37:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:37:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:21,379 INFO L225 Difference]: With dead ends: 3656 [2025-03-16 19:37:21,379 INFO L226 Difference]: Without dead ends: 3232 [2025-03-16 19:37:21,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:37:21,380 INFO L435 NwaCegarLoop]: 1203 mSDtfsCounter, 8816 mSDsluCounter, 5573 mSDsCounter, 0 mSdLazyCounter, 5484 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8816 SdHoareTripleChecker+Valid, 6776 SdHoareTripleChecker+Invalid, 5792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 5484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:21,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8816 Valid, 6776 Invalid, 5792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 5484 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 19:37:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-03-16 19:37:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1603. [2025-03-16 19:37:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1574 states have (on average 1.4097839898348157) internal successors, (2219), 1602 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2219 transitions. [2025-03-16 19:37:21,396 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2219 transitions. Word has length 111 [2025-03-16 19:37:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:21,396 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2219 transitions. [2025-03-16 19:37:21,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2219 transitions. [2025-03-16 19:37:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:21,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:21,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:37:21,398 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash -987177455, now seen corresponding path program 1 times [2025-03-16 19:37:21,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:21,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125192298] [2025-03-16 19:37:21,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:21,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:21,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:21,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:21,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:21,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:21,557 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-16 19:37:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:21,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125192298] [2025-03-16 19:37:21,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125192298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25219834] [2025-03-16 19:37:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:21,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:21,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:21,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:21,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:21,559 INFO L87 Difference]: Start difference. First operand 1603 states and 2219 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:22,675 INFO L93 Difference]: Finished difference Result 2642 states and 3675 transitions. [2025-03-16 19:37:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:22,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:22,678 INFO L225 Difference]: With dead ends: 2642 [2025-03-16 19:37:22,678 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 19:37:22,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:22,679 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 3631 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3631 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:22,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3631 Valid, 3931 Invalid, 3182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 19:37:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1603. [2025-03-16 19:37:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1574 states have (on average 1.4085133418043203) internal successors, (2217), 1602 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2217 transitions. [2025-03-16 19:37:22,692 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2217 transitions. Word has length 111 [2025-03-16 19:37:22,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:22,692 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2217 transitions. [2025-03-16 19:37:22,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2217 transitions. [2025-03-16 19:37:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:22,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:22,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:22,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:37:22,694 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:22,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:22,695 INFO L85 PathProgramCache]: Analyzing trace with hash -760756258, now seen corresponding path program 1 times [2025-03-16 19:37:22,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:22,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435402634] [2025-03-16 19:37:22,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:22,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:22,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:22,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:22,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:22,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:22,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:22,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:22,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435402634] [2025-03-16 19:37:22,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435402634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464311784] [2025-03-16 19:37:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:22,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:22,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:22,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:22,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:22,863 INFO L87 Difference]: Start difference. First operand 1603 states and 2217 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:23,913 INFO L93 Difference]: Finished difference Result 2474 states and 3389 transitions. [2025-03-16 19:37:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:23,915 INFO L225 Difference]: With dead ends: 2474 [2025-03-16 19:37:23,915 INFO L226 Difference]: Without dead ends: 2296 [2025-03-16 19:37:23,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:23,916 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 3984 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3984 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:23,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3984 Valid, 3296 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:37:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-03-16 19:37:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1603. [2025-03-16 19:37:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1574 states have (on average 1.4072426937738247) internal successors, (2215), 1602 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2215 transitions. [2025-03-16 19:37:23,928 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2215 transitions. Word has length 111 [2025-03-16 19:37:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:23,928 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2215 transitions. [2025-03-16 19:37:23,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2215 transitions. [2025-03-16 19:37:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:37:23,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:23,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:37:23,929 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 272036064, now seen corresponding path program 1 times [2025-03-16 19:37:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996050897] [2025-03-16 19:37:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:23,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:37:23,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:37:23,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:23,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:24,123 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-16 19:37:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:24,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996050897] [2025-03-16 19:37:24,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996050897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:24,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:24,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:24,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105400177] [2025-03-16 19:37:24,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:24,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:24,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:24,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:24,125 INFO L87 Difference]: Start difference. First operand 1603 states and 2215 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:25,407 INFO L93 Difference]: Finished difference Result 2634 states and 3659 transitions. [2025-03-16 19:37:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2025-03-16 19:37:25,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:25,410 INFO L225 Difference]: With dead ends: 2634 [2025-03-16 19:37:25,410 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 19:37:25,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:25,411 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 4489 mSDsluCounter, 3890 mSDsCounter, 0 mSdLazyCounter, 3745 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 4865 SdHoareTripleChecker+Invalid, 3749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:25,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 4865 Invalid, 3749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3745 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 19:37:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1603. [2025-03-16 19:37:25,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1574 states have (on average 1.4059720457433291) internal successors, (2213), 1602 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2213 transitions. [2025-03-16 19:37:25,423 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2213 transitions. Word has length 111 [2025-03-16 19:37:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:25,423 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2213 transitions. [2025-03-16 19:37:25,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2213 transitions. [2025-03-16 19:37:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:25,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:25,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:25,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:37:25,425 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:25,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:25,425 INFO L85 PathProgramCache]: Analyzing trace with hash -707196189, now seen corresponding path program 1 times [2025-03-16 19:37:25,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:25,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016025566] [2025-03-16 19:37:25,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:25,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:25,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:25,609 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-16 19:37:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016025566] [2025-03-16 19:37:25,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016025566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:25,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:25,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:25,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543548769] [2025-03-16 19:37:25,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:25,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:25,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:25,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:25,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:25,610 INFO L87 Difference]: Start difference. First operand 1603 states and 2213 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:26,764 INFO L93 Difference]: Finished difference Result 2611 states and 3623 transitions. [2025-03-16 19:37:26,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:26,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:26,766 INFO L225 Difference]: With dead ends: 2611 [2025-03-16 19:37:26,766 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 19:37:26,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:26,767 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 3588 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 3238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3588 SdHoareTripleChecker+Valid, 3987 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:26,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3588 Valid, 3987 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 19:37:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1599. [2025-03-16 19:37:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1570 states have (on average 1.4063694267515923) internal successors, (2208), 1598 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-16 19:37:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2208 transitions. [2025-03-16 19:37:26,779 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2208 transitions. Word has length 112 [2025-03-16 19:37:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:26,780 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2208 transitions. [2025-03-16 19:37:26,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2208 transitions. [2025-03-16 19:37:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:26,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:26,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:37:26,781 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:26,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash 94776984, now seen corresponding path program 1 times [2025-03-16 19:37:26,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:26,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675326727] [2025-03-16 19:37:26,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:26,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:26,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:26,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:26,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:26,951 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-16 19:37:26,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:26,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675326727] [2025-03-16 19:37:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675326727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:26,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599223522] [2025-03-16 19:37:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:26,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:26,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:26,952 INFO L87 Difference]: Start difference. First operand 1599 states and 2208 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:28,098 INFO L93 Difference]: Finished difference Result 2611 states and 3623 transitions. [2025-03-16 19:37:28,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:28,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:28,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:28,100 INFO L225 Difference]: With dead ends: 2611 [2025-03-16 19:37:28,100 INFO L226 Difference]: Without dead ends: 2416 [2025-03-16 19:37:28,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:28,101 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 5500 mSDsluCounter, 3125 mSDsCounter, 0 mSdLazyCounter, 3294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5500 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:28,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5500 Valid, 4063 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-16 19:37:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1595. [2025-03-16 19:37:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1566 states have (on average 1.4067688378033205) internal successors, (2203), 1594 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2203 transitions. [2025-03-16 19:37:28,114 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2203 transitions. Word has length 112 [2025-03-16 19:37:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:28,114 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2203 transitions. [2025-03-16 19:37:28,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:28,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2203 transitions. [2025-03-16 19:37:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:28,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:28,115 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:28,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:37:28,115 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:28,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1115117046, now seen corresponding path program 1 times [2025-03-16 19:37:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:28,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794580367] [2025-03-16 19:37:28,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:28,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:28,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:28,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:28,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:28,283 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-16 19:37:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:28,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794580367] [2025-03-16 19:37:28,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794580367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:28,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892002034] [2025-03-16 19:37:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:28,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:28,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:28,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:28,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:28,284 INFO L87 Difference]: Start difference. First operand 1595 states and 2203 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:29,468 INFO L93 Difference]: Finished difference Result 2670 states and 3709 transitions. [2025-03-16 19:37:29,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:29,471 INFO L225 Difference]: With dead ends: 2670 [2025-03-16 19:37:29,471 INFO L226 Difference]: Without dead ends: 2436 [2025-03-16 19:37:29,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:29,471 INFO L435 NwaCegarLoop]: 1024 mSDtfsCounter, 5235 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5235 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:29,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5235 Valid, 4434 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-16 19:37:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1591. [2025-03-16 19:37:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1562 states have (on average 1.4071702944942381) internal successors, (2198), 1590 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-16 19:37:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2198 transitions. [2025-03-16 19:37:29,484 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2198 transitions. Word has length 112 [2025-03-16 19:37:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:29,484 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2198 transitions. [2025-03-16 19:37:29,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:29,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2198 transitions. [2025-03-16 19:37:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:29,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:29,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:29,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:37:29,486 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:29,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1874396293, now seen corresponding path program 1 times [2025-03-16 19:37:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004113756] [2025-03-16 19:37:29,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:29,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:29,651 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-16 19:37:29,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:29,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004113756] [2025-03-16 19:37:29,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004113756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:29,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:29,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:29,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835440456] [2025-03-16 19:37:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:29,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:29,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:29,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:29,652 INFO L87 Difference]: Start difference. First operand 1591 states and 2198 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:30,833 INFO L93 Difference]: Finished difference Result 2626 states and 3644 transitions. [2025-03-16 19:37:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:37:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:30,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:30,836 INFO L225 Difference]: With dead ends: 2626 [2025-03-16 19:37:30,836 INFO L226 Difference]: Without dead ends: 2412 [2025-03-16 19:37:30,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:30,837 INFO L435 NwaCegarLoop]: 1151 mSDtfsCounter, 3036 mSDsluCounter, 3757 mSDsCounter, 0 mSdLazyCounter, 3656 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3036 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 3660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:30,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3036 Valid, 4908 Invalid, 3660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2025-03-16 19:37:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1583. [2025-03-16 19:37:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1554 states have (on average 1.407979407979408) internal successors, (2188), 1582 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-16 19:37:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2188 transitions. [2025-03-16 19:37:30,849 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2188 transitions. Word has length 112 [2025-03-16 19:37:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:30,849 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2188 transitions. [2025-03-16 19:37:30,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2188 transitions. [2025-03-16 19:37:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:30,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:30,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:30,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:37:30,850 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1626652138, now seen corresponding path program 1 times [2025-03-16 19:37:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683052796] [2025-03-16 19:37:30,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:30,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:30,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:30,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683052796] [2025-03-16 19:37:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683052796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:31,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:31,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742994392] [2025-03-16 19:37:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:31,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:31,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:31,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:31,020 INFO L87 Difference]: Start difference. First operand 1583 states and 2188 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:32,240 INFO L93 Difference]: Finished difference Result 2696 states and 3749 transitions. [2025-03-16 19:37:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:32,242 INFO L225 Difference]: With dead ends: 2696 [2025-03-16 19:37:32,242 INFO L226 Difference]: Without dead ends: 2428 [2025-03-16 19:37:32,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:32,243 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 5067 mSDsluCounter, 3545 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 4614 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2025-03-16 19:37:32,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 1575. [2025-03-16 19:37:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1546 states have (on average 1.408796895213454) internal successors, (2178), 1574 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-16 19:37:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2178 transitions. [2025-03-16 19:37:32,255 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2178 transitions. Word has length 112 [2025-03-16 19:37:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:32,255 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2178 transitions. [2025-03-16 19:37:32,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2178 transitions. [2025-03-16 19:37:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:37:32,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:32,257 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:32,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:37:32,257 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:32,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash -269281617, now seen corresponding path program 1 times [2025-03-16 19:37:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584780936] [2025-03-16 19:37:32,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:32,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:37:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:37:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:32,417 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-16 19:37:32,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:32,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584780936] [2025-03-16 19:37:32,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584780936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:32,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:32,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:32,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745081118] [2025-03-16 19:37:32,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:32,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:32,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:32,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:32,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:32,418 INFO L87 Difference]: Start difference. First operand 1575 states and 2178 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:33,669 INFO L93 Difference]: Finished difference Result 2876 states and 3998 transitions. [2025-03-16 19:37:33,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:33,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-03-16 19:37:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:33,672 INFO L225 Difference]: With dead ends: 2876 [2025-03-16 19:37:33,672 INFO L226 Difference]: Without dead ends: 2452 [2025-03-16 19:37:33,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:33,673 INFO L435 NwaCegarLoop]: 1206 mSDtfsCounter, 3093 mSDsluCounter, 3976 mSDsCounter, 0 mSdLazyCounter, 3956 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3093 SdHoareTripleChecker+Valid, 5182 SdHoareTripleChecker+Invalid, 3960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:33,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3093 Valid, 5182 Invalid, 3960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3956 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-03-16 19:37:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1567. [2025-03-16 19:37:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4096228868660599) internal successors, (2168), 1566 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-16 19:37:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2168 transitions. [2025-03-16 19:37:33,685 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2168 transitions. Word has length 112 [2025-03-16 19:37:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:33,686 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2168 transitions. [2025-03-16 19:37:33,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2168 transitions. [2025-03-16 19:37:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:33,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:33,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:37:33,688 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:33,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 577514510, now seen corresponding path program 1 times [2025-03-16 19:37:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133804181] [2025-03-16 19:37:33,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:33,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:33,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:33,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:33,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:33,844 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-16 19:37:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:33,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133804181] [2025-03-16 19:37:33,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133804181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:33,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:33,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118677887] [2025-03-16 19:37:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:33,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:33,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:33,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:33,845 INFO L87 Difference]: Start difference. First operand 1567 states and 2168 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:34,990 INFO L93 Difference]: Finished difference Result 2525 states and 3493 transitions. [2025-03-16 19:37:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:34,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:34,993 INFO L225 Difference]: With dead ends: 2525 [2025-03-16 19:37:34,993 INFO L226 Difference]: Without dead ends: 2348 [2025-03-16 19:37:34,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:34,994 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 3494 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3494 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:34,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3494 Valid, 4200 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-16 19:37:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2025-03-16 19:37:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4089726918075423) internal successors, (2167), 1566 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-16 19:37:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2167 transitions. [2025-03-16 19:37:35,016 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2167 transitions. Word has length 113 [2025-03-16 19:37:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:35,016 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2167 transitions. [2025-03-16 19:37:35,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2167 transitions. [2025-03-16 19:37:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:35,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:35,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:37:35,018 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-16 19:37:35,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 210530956, now seen corresponding path program 1 times [2025-03-16 19:37:35,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:35,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458699494] [2025-03-16 19:37:35,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:35,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:35,218 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-16 19:37:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458699494] [2025-03-16 19:37:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458699494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:35,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476396354] [2025-03-16 19:37:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:35,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:35,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:35,219 INFO L87 Difference]: Start difference. First operand 1567 states and 2167 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:36,489 INFO L93 Difference]: Finished difference Result 2525 states and 3491 transitions. [2025-03-16 19:37:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:37:36,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:36,492 INFO L225 Difference]: With dead ends: 2525 [2025-03-16 19:37:36,492 INFO L226 Difference]: Without dead ends: 2348 [2025-03-16 19:37:36,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:37:36,492 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 4560 mSDsluCounter, 4037 mSDsCounter, 0 mSdLazyCounter, 3867 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4560 SdHoareTripleChecker+Valid, 5154 SdHoareTripleChecker+Invalid, 3871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:36,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4560 Valid, 5154 Invalid, 3871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3867 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:37:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-16 19:37:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2025-03-16 19:37:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4083224967490247) internal successors, (2166), 1566 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-16 19:37:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2166 transitions. [2025-03-16 19:37:36,505 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2166 transitions. Word has length 113 [2025-03-16 19:37:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:36,505 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2166 transitions. [2025-03-16 19:37:36,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2166 transitions. [2025-03-16 19:37:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:36,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:36,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:37:36,506 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:36,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:36,507 INFO L85 PathProgramCache]: Analyzing trace with hash -473330887, now seen corresponding path program 1 times [2025-03-16 19:37:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:36,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245250357] [2025-03-16 19:37:36,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:36,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:36,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:36,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:36,665 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-16 19:37:36,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:36,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245250357] [2025-03-16 19:37:36,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245250357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:36,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:36,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:36,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035152217] [2025-03-16 19:37:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:36,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:36,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:36,665 INFO L87 Difference]: Start difference. First operand 1567 states and 2166 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:37,847 INFO L93 Difference]: Finished difference Result 2530 states and 3494 transitions. [2025-03-16 19:37:37,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:37,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:37,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:37,849 INFO L225 Difference]: With dead ends: 2530 [2025-03-16 19:37:37,849 INFO L226 Difference]: Without dead ends: 2348 [2025-03-16 19:37:37,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:37,850 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 5261 mSDsluCounter, 3212 mSDsCounter, 0 mSdLazyCounter, 3389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5261 SdHoareTripleChecker+Valid, 4200 SdHoareTripleChecker+Invalid, 3393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:37,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5261 Valid, 4200 Invalid, 3393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3389 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:37:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2025-03-16 19:37:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1567. [2025-03-16 19:37:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.407672301690507) internal successors, (2165), 1566 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-16 19:37:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2165 transitions. [2025-03-16 19:37:37,861 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2165 transitions. Word has length 113 [2025-03-16 19:37:37,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:37,861 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2165 transitions. [2025-03-16 19:37:37,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:37,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2165 transitions. [2025-03-16 19:37:37,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:37,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:37,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:37,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:37:37,862 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:37,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 317518423, now seen corresponding path program 1 times [2025-03-16 19:37:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:37,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317721565] [2025-03-16 19:37:37,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:37,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:38,024 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-16 19:37:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317721565] [2025-03-16 19:37:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317721565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:38,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527636995] [2025-03-16 19:37:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:38,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:38,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:38,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:38,025 INFO L87 Difference]: Start difference. First operand 1567 states and 2165 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:39,084 INFO L93 Difference]: Finished difference Result 2432 states and 3328 transitions. [2025-03-16 19:37:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:39,087 INFO L225 Difference]: With dead ends: 2432 [2025-03-16 19:37:39,087 INFO L226 Difference]: Without dead ends: 2260 [2025-03-16 19:37:39,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:39,088 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 5605 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 3102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5605 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:39,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5605 Valid, 3581 Invalid, 3105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:37:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-03-16 19:37:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1567. [2025-03-16 19:37:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.4070221066319897) internal successors, (2164), 1566 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-16 19:37:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2164 transitions. [2025-03-16 19:37:39,098 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2164 transitions. Word has length 113 [2025-03-16 19:37:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:39,098 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2164 transitions. [2025-03-16 19:37:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2164 transitions. [2025-03-16 19:37:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:39,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:39,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:37:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 19:37:39,099 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 649228629, now seen corresponding path program 1 times [2025-03-16 19:37:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:39,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751590370] [2025-03-16 19:37:39,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:39,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:39,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:39,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:39,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:39,265 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-16 19:37:39,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751590370] [2025-03-16 19:37:39,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751590370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:39,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:39,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:39,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337733318] [2025-03-16 19:37:39,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:39,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:39,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:39,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:39,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:39,266 INFO L87 Difference]: Start difference. First operand 1567 states and 2164 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:37:40,304 INFO L93 Difference]: Finished difference Result 2432 states and 3326 transitions. [2025-03-16 19:37:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:37:40,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2025-03-16 19:37:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:37:40,307 INFO L225 Difference]: With dead ends: 2432 [2025-03-16 19:37:40,307 INFO L226 Difference]: Without dead ends: 2260 [2025-03-16 19:37:40,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:37:40,308 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 5812 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5812 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:37:40,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5812 Valid, 3364 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:37:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2025-03-16 19:37:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1567. [2025-03-16 19:37:40,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1538 states have (on average 1.406371911573472) internal successors, (2163), 1566 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-16 19:37:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2163 transitions. [2025-03-16 19:37:40,318 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2163 transitions. Word has length 113 [2025-03-16 19:37:40,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:37:40,318 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2163 transitions. [2025-03-16 19:37:40,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:37:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2163 transitions. [2025-03-16 19:37:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:37:40,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:37:40,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:37:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 19:37:40,320 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-16 19:37:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:37:40,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1788350610, now seen corresponding path program 1 times [2025-03-16 19:37:40,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:37:40,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778314779] [2025-03-16 19:37:40,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:37:40,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:37:40,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:37:40,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:37:40,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:37:40,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:37:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:37:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:37:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778314779] [2025-03-16 19:37:40,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778314779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:37:40,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:37:40,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:37:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694157682] [2025-03-16 19:37:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:37:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:37:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:37:40,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:37:40,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:37:40,519 INFO L87 Difference]: Start difference. First operand 1567 states and 2163 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)