./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:34:28,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:34:28,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:34:28,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:34:28,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:34:28,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:34:28,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:34:28,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:34:28,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:34:28,829 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:34:28,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:34:28,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:34:28,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:34:28,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:34:28,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:34:28,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:34:28,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:28,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:34:28,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:34:28,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:34:28,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:34:28,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:34:28,833 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 -> c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 [2025-03-16 19:34:29,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:34:29,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:34:29,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:34:29,076 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:34:29,076 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:34:29,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:34:30,192 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f529cf21e/11e0e7a42f584540b80c0a2f801f1e13/FLAG5b98f4ebd [2025-03-16 19:34:30,517 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:34:30,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:34:30,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f529cf21e/11e0e7a42f584540b80c0a2f801f1e13/FLAG5b98f4ebd [2025-03-16 19:34:30,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f529cf21e/11e0e7a42f584540b80c0a2f801f1e13 [2025-03-16 19:34:30,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:34:30,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:34:30,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:30,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:34:30,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:34:30,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:30" (1/1) ... [2025-03-16 19:34:30,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e12e603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:30, skipping insertion in model container [2025-03-16 19:34:30,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:30" (1/1) ... [2025-03-16 19:34:30,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:34:31,113 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2025-03-16 19:34:31,153 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2025-03-16 19:34:31,167 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2025-03-16 19:34:31,175 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2025-03-16 19:34:31,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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2025-03-16 19:34:31,214 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2025-03-16 19:34:31,226 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2025-03-16 19:34:31,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2025-03-16 19:34:31,241 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2025-03-16 19:34:31,247 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2025-03-16 19:34:31,252 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2025-03-16 19:34:31,258 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2025-03-16 19:34:31,263 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2025-03-16 19:34:31,270 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2025-03-16 19:34:31,275 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2025-03-16 19:34:31,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2025-03-16 19:34:31,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:31,321 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:34:31,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2025-03-16 19:34:31,427 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2025-03-16 19:34:31,441 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2025-03-16 19:34:31,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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2025-03-16 19:34:31,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2025-03-16 19:34:31,475 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2025-03-16 19:34:31,487 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2025-03-16 19:34:31,493 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2025-03-16 19:34:31,498 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2025-03-16 19:34:31,504 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2025-03-16 19:34:31,509 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2025-03-16 19:34:31,514 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2025-03-16 19:34:31,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2025-03-16 19:34:31,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2025-03-16 19:34:31,531 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2025-03-16 19:34:31,537 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.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2025-03-16 19:34:31,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:31,598 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:34:31,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31 WrapperNode [2025-03-16 19:34:31,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:31,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:31,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:34:31,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:34:31,605 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:34:31" (1/1) ... [2025-03-16 19:34:31,635 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:34:31" (1/1) ... [2025-03-16 19:34:31,718 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5769 [2025-03-16 19:34:31,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:31,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:34:31,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:34:31,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:34:31,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,783 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:34:31,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:34:31,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:34:31,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:34:31,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:34:31,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (1/1) ... [2025-03-16 19:34:31,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:31,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:31,902 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:34:31,905 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:34:31,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:34:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:34:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:34:31,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:34:32,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:34:32,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:34:34,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7369: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1;havoc main_~node5__m5~37#1;havoc main_~node4__m4~31#1;havoc main_~node3__m3~28#1;havoc main_~node2__m2~26#1;havoc main_~node1__m1~25#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~39#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4861: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~18#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: havoc main_~node5__m5~13#1;havoc main_~node4__m4~11#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~9#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~12#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~12#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5660: havoc main_~check__tmp~32#1;havoc main_~node5__m5~28#1;havoc main_~node4__m4~23#1;havoc main_~node3__m3~21#1;havoc main_~node2__m2~20#1;havoc main_~node1__m1~19#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~31#1; [2025-03-16 19:34:34,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9492: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6058: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~25#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7645: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1;havoc main_~node5__m5~38#1;havoc main_~node4__m4~32#1;havoc main_~node3__m3~29#1;havoc main_~node2__m2~27#1;havoc main_~node1__m1~26#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9364: havoc main_~node3__m3~36#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8309: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~35#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5933: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~34#1;havoc main_~node5__m5~29#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~22#1;havoc main_~node2__m2~21#1;havoc main_~node1__m1~20#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~33#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4878: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~20#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1316: havoc main_~check__tmp~4#1;havoc main_~node5__m5~5#1;havoc main_~node4__m4~4#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6075: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~30#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~5#1; [2025-03-16 19:34:34,388 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7927: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1;havoc main_~node5__m5~40#1;havoc main_~node4__m4~33#1;havoc main_~node3__m3~30#1;havoc main_~node2__m2~28#1;havoc main_~node1__m1~27#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8192: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1;havoc main_~node5__m5~41#1;havoc main_~node4__m4~34#1;havoc main_~node3__m3~31#1;havoc main_~node2__m2~29#1;havoc main_~node1__m1~28#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8326: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~42#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: havoc main_~check__tmp~14#1;havoc main_~node5__m5~14#1;havoc main_~node4__m4~12#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1;havoc main_~node1__m1~10#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~13#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4895: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9520: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3178: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~15#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1598: havoc main_~node5__m5~7#1;havoc main_~node4__m4~6#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~5#1;havoc main_~node1__m1~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~5#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8866: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~45#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9396: havoc main_~node4__m4~40#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~6#1; [2025-03-16 19:34:34,389 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~33#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6229: havoc main_~check__tmp~36#1;havoc main_~node5__m5~31#1;havoc main_~node4__m4~26#1;havoc main_~node3__m3~23#1;havoc main_~node2__m2~22#1;havoc main_~node1__m1~21#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~35#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6502: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1;havoc main_~node5__m5~32#1;havoc main_~node4__m4~27#1;havoc main_~node3__m3~24#1;havoc main_~node2__m2~23#1;havoc main_~node1__m1~22#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3332: havoc main_~check__tmp~16#1;havoc main_~node5__m5~16#1;havoc main_~node4__m4~13#1;havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1;havoc main_~node1__m1~11#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8486: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1;havoc main_~node5__m5~43#1;havoc main_~node4__m4~36#1;havoc main_~node3__m3~32#1;havoc main_~node2__m2~30#1;havoc main_~node1__m1~29#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~15#1; [2025-03-16 19:34:34,390 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8752: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1;havoc main_~node5__m5~44#1;havoc main_~node4__m4~37#1;havoc main_~node3__m3~33#1;havoc main_~node2__m2~31#1;havoc main_~node1__m1~30#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-03-16 19:34:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:34:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~27#1; [2025-03-16 19:34:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9548: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-16 19:34:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: havoc main_~check__tmp~28#1;havoc main_~node5__m5~25#1;havoc main_~node4__m4~21#1;havoc main_~node3__m3~19#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~17#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~27#1; [2025-03-16 19:34:34,391 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~18#1;havoc main_~node5__m5~17#1;havoc main_~node4__m4~14#1;havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1;havoc main_~node1__m1~12#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~17#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9291: havoc main_~node1__m1~33#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1;havoc main_~node5__m5~47#1;havoc main_~node4__m4~39#1;havoc main_~node3__m3~35#1;havoc main_~node2__m2~33#1;havoc main_~node1__m1~32#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9029: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1;havoc main_~node5__m5~46#1;havoc main_~node4__m4~38#1;havoc main_~node3__m3~34#1;havoc main_~node2__m2~32#1;havoc main_~node1__m1~31#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6784: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1;havoc main_~node5__m5~34#1;havoc main_~node4__m4~28#1;havoc main_~node3__m3~25#1;havoc main_~node2__m2~24#1;havoc main_~node1__m1~23#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~check__tmp~7#1;havoc main_~node5__m5~8#1;havoc main_~node4__m4~7#1;havoc main_~node3__m3~6#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~6#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7049: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1;havoc main_~node5__m5~35#1;havoc main_~node4__m4~29#1;havoc main_~node3__m3~26#1;havoc main_~node2__m2~25#1;havoc main_~node1__m1~24#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2029: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~9#1; [2025-03-16 19:34:34,392 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3747: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~18#1; [2025-03-16 19:34:34,393 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:34:34,393 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~30#1; [2025-03-16 19:34:34,393 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9577: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: havoc main_~node5__m5~2#1;havoc main_~node4__m4~2#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4296: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~21#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7203: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~36#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2183: havoc main_~check__tmp~9#1;havoc main_~node5__m5~10#1;havoc main_~node4__m4~8#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~7#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~8#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3901: havoc main_~check__tmp~20#1;havoc main_~node5__m5~19#1;havoc main_~node4__m4~16#1;havoc main_~node3__m3~14#1;havoc main_~node2__m2~13#1;havoc main_~node1__m1~13#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~19#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2584: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~9#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2456: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~11#1;havoc main_~node5__m5~11#1;havoc main_~node4__m4~9#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~10#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4174: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~22#1;havoc main_~node5__m5~20#1;havoc main_~node4__m4~17#1;havoc main_~node3__m3~15#1;havoc main_~node2__m2~14#1;havoc main_~node1__m1~14#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~21#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9332: havoc main_~node2__m2~34#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9464: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~48#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~17#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5373: havoc main_~check__tmp~30#1;havoc main_~node5__m5~26#1;havoc main_~node4__m4~22#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~19#1;havoc main_~node1__m1~18#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5506: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~27#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2601: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~24#1;havoc main_~node5__m5~22#1;havoc main_~node4__m4~18#1;havoc main_~node3__m3~16#1;havoc main_~node2__m2~15#1;havoc main_~node1__m1~15#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~23#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L889: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~3#1; [2025-03-16 19:34:34,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4721: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~26#1;havoc main_~node5__m5~23#1;havoc main_~node4__m4~19#1;havoc main_~node3__m3~17#1;havoc main_~node2__m2~16#1;havoc main_~node1__m1~16#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~25#1; [2025-03-16 19:34:34,395 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~node5__m5~4#1;havoc main_~node4__m4~3#1;havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:34:34,614 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2025-03-16 19:34:34,616 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:34:34,647 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:34:34,647 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:34:34,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:34 BoogieIcfgContainer [2025-03-16 19:34:34,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:34:34,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:34:34,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:34:34,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:34:34,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:34:30" (1/3) ... [2025-03-16 19:34:34,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0ba134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:34, skipping insertion in model container [2025-03-16 19:34:34,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:31" (2/3) ... [2025-03-16 19:34:34,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0ba134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:34, skipping insertion in model container [2025-03-16 19:34:34,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:34" (3/3) ... [2025-03-16 19:34:34,656 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-16 19:34:34,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:34:34,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 1110 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-16 19:34:34,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:34:34,777 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;@50b5e468, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:34:34,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-16 19:34:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 1110 states, 1093 states have (on average 1.827996340347667) internal successors, (1998), 1109 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states 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:34:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:34:34,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:34,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:34,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:34,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1134646926, now seen corresponding path program 1 times [2025-03-16 19:34:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:34,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676792496] [2025-03-16 19:34:34,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:34,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:34:35,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:34:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,304 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:34:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676792496] [2025-03-16 19:34:35,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676792496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977385531] [2025-03-16 19:34:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:35,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:35,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:35,337 INFO L87 Difference]: Start difference. First operand has 1110 states, 1093 states have (on average 1.827996340347667) internal successors, (1998), 1109 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,065 INFO L93 Difference]: Finished difference Result 1448 states and 2551 transitions. [2025-03-16 19:34:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:36,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:34:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,080 INFO L225 Difference]: With dead ends: 1448 [2025-03-16 19:34:36,080 INFO L226 Difference]: Without dead ends: 870 [2025-03-16 19:34:36,087 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:34:36,092 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 4511 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 856 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-16 19:34:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-16 19:34:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 854 states have (on average 1.319672131147541) internal successors, (1127), 869 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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:34:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1127 transitions. [2025-03-16 19:34:36,153 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1127 transitions. Word has length 71 [2025-03-16 19:34:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1127 transitions. [2025-03-16 19:34:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1127 transitions. [2025-03-16 19:34:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:34:36,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:34:36,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:36,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -253969690, now seen corresponding path program 1 times [2025-03-16 19:34:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84863674] [2025-03-16 19:34:36,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:34:36,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:34:36,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,341 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:34:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84863674] [2025-03-16 19:34:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84863674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987023719] [2025-03-16 19:34:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:36,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:36,344 INFO L87 Difference]: Start difference. First operand 870 states and 1127 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,765 INFO L93 Difference]: Finished difference Result 1135 states and 1468 transitions. [2025-03-16 19:34:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:34:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,767 INFO L225 Difference]: With dead ends: 1135 [2025-03-16 19:34:36,767 INFO L226 Difference]: Without dead ends: 689 [2025-03-16 19:34:36,768 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:34:36,769 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 2643 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 437 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-16 19:34:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-03-16 19:34:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 673 states have (on average 1.338781575037147) internal successors, (901), 688 states have internal predecessors, (901), 0 states have call successors, (0), 0 states 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:34:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 901 transitions. [2025-03-16 19:34:36,781 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 901 transitions. Word has length 71 [2025-03-16 19:34:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 901 transitions. [2025-03-16 19:34:36,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 901 transitions. [2025-03-16 19:34:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:34:36,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:36,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:34:36,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:36,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1543411781, now seen corresponding path program 1 times [2025-03-16 19:34:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10405869] [2025-03-16 19:34:36,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:34:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:34:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,937 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:34:36,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10405869] [2025-03-16 19:34:36,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10405869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496528837] [2025-03-16 19:34:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:36,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:36,938 INFO L87 Difference]: Start difference. First operand 689 states and 901 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,199 INFO L93 Difference]: Finished difference Result 826 states and 1065 transitions. [2025-03-16 19:34:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:37,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 19:34:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,201 INFO L225 Difference]: With dead ends: 826 [2025-03-16 19:34:37,201 INFO L226 Difference]: Without dead ends: 475 [2025-03-16 19:34:37,201 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:34:37,202 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1767 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:37,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 343 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-16 19:34:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2025-03-16 19:34:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 459 states have (on average 1.3420479302832244) internal successors, (616), 474 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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:34:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 616 transitions. [2025-03-16 19:34:37,209 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 616 transitions. Word has length 71 [2025-03-16 19:34:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,209 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 616 transitions. [2025-03-16 19:34:37,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:34:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 616 transitions. [2025-03-16 19:34:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:34:37,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:34:37,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1412133118, now seen corresponding path program 1 times [2025-03-16 19:34:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464411927] [2025-03-16 19:34:37,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:34:37,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:34:37,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,354 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:34:37,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464411927] [2025-03-16 19:34:37,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464411927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:37,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159916422] [2025-03-16 19:34:37,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:37,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:37,358 INFO L87 Difference]: Start difference. First operand 475 states and 616 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,563 INFO L93 Difference]: Finished difference Result 652 states and 843 transitions. [2025-03-16 19:34:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:37,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 19:34:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,564 INFO L225 Difference]: With dead ends: 652 [2025-03-16 19:34:37,564 INFO L226 Difference]: Without dead ends: 397 [2025-03-16 19:34:37,565 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:34:37,565 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1475 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:37,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 307 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-16 19:34:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-16 19:34:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 381 states have (on average 1.3490813648293962) internal successors, (514), 396 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:34:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 514 transitions. [2025-03-16 19:34:37,574 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 514 transitions. Word has length 72 [2025-03-16 19:34:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,574 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 514 transitions. [2025-03-16 19:34:37,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 514 transitions. [2025-03-16 19:34:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:34:37,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:37,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:34:37,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:37,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1406315288, now seen corresponding path program 1 times [2025-03-16 19:34:37,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77984685] [2025-03-16 19:34:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:34:37,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:34:37,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,707 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:34:37,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77984685] [2025-03-16 19:34:37,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77984685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:37,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894142066] [2025-03-16 19:34:37,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:37,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:37,708 INFO L87 Difference]: Start difference. First operand 397 states and 514 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,934 INFO L93 Difference]: Finished difference Result 609 states and 796 transitions. [2025-03-16 19:34:37,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-16 19:34:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,937 INFO L225 Difference]: With dead ends: 609 [2025-03-16 19:34:37,937 INFO L226 Difference]: Without dead ends: 389 [2025-03-16 19:34:37,937 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:34:37,938 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1411 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:37,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 280 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-16 19:34:37,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-16 19:34:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.351206434316354) internal successors, (504), 388 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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:34:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2025-03-16 19:34:37,944 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 73 [2025-03-16 19:34:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,945 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2025-03-16 19:34:37,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2025-03-16 19:34:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:37,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:37,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:34:37,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:37,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2055088497, now seen corresponding path program 1 times [2025-03-16 19:34:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338556480] [2025-03-16 19:34:37,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:37,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:37,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:38,338 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:34:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:38,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338556480] [2025-03-16 19:34:38,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338556480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:38,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:34:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820114668] [2025-03-16 19:34:38,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:38,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:34:38,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:38,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:34:38,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:34:38,341 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,055 INFO L93 Difference]: Finished difference Result 745 states and 978 transitions. [2025-03-16 19:34:39,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:39,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:34:39,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,058 INFO L225 Difference]: With dead ends: 745 [2025-03-16 19:34:39,058 INFO L226 Difference]: Without dead ends: 602 [2025-03-16 19:34:39,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:34:39,059 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1324 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1762 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-16 19:34:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 389. [2025-03-16 19:34:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3485254691689008) internal successors, (503), 388 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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:34:39,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2025-03-16 19:34:39,070 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 503 transitions. Word has length 74 [2025-03-16 19:34:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,071 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 503 transitions. [2025-03-16 19:34:39,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 503 transitions. [2025-03-16 19:34:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:39,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:34:39,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1503542183, now seen corresponding path program 1 times [2025-03-16 19:34:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928193260] [2025-03-16 19:34:39,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:39,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:39,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:39,289 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:34:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:39,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928193260] [2025-03-16 19:34:39,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928193260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:34:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582475039] [2025-03-16 19:34:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:39,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:34:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:39,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:34:39,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:39,291 INFO L87 Difference]: Start difference. First operand 389 states and 503 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,733 INFO L93 Difference]: Finished difference Result 753 states and 959 transitions. [2025-03-16 19:34:39,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:39,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:34:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,735 INFO L225 Difference]: With dead ends: 753 [2025-03-16 19:34:39,735 INFO L226 Difference]: Without dead ends: 541 [2025-03-16 19:34:39,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:39,736 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1755 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 892 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-16 19:34:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2025-03-16 19:34:39,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 388 states have internal predecessors, (502), 0 states have call successors, (0), 0 states 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:34:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2025-03-16 19:34:39,746 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 74 [2025-03-16 19:34:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,746 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2025-03-16 19:34:39,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2025-03-16 19:34:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:39,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:39,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:34:39,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 501621946, now seen corresponding path program 1 times [2025-03-16 19:34:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247247695] [2025-03-16 19:34:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:39,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:39,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,038 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:34:40,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247247695] [2025-03-16 19:34:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247247695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:34:40,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948946281] [2025-03-16 19:34:40,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:34:40,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:34:40,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:40,040 INFO L87 Difference]: Start difference. First operand 389 states and 502 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:40,810 INFO L93 Difference]: Finished difference Result 689 states and 900 transitions. [2025-03-16 19:34:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 19:34:40,810 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:34:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:40,812 INFO L225 Difference]: With dead ends: 689 [2025-03-16 19:34:40,813 INFO L226 Difference]: Without dead ends: 608 [2025-03-16 19:34:40,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:34:40,814 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 2156 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:40,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 1636 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-16 19:34:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 398. [2025-03-16 19:34:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3455497382198953) internal successors, (514), 397 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:34:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 514 transitions. [2025-03-16 19:34:40,823 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 514 transitions. Word has length 74 [2025-03-16 19:34:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 514 transitions. [2025-03-16 19:34:40,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 514 transitions. [2025-03-16 19:34:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:40,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:40,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:34:40,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1219398820, now seen corresponding path program 1 times [2025-03-16 19:34:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908949486] [2025-03-16 19:34:40,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:40,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:40,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:40,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:41,063 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:34:41,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908949486] [2025-03-16 19:34:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908949486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678570605] [2025-03-16 19:34:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:41,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:41,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:41,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:41,065 INFO L87 Difference]: Start difference. First operand 398 states and 514 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:41,711 INFO L93 Difference]: Finished difference Result 732 states and 963 transitions. [2025-03-16 19:34:41,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:41,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:34:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:41,713 INFO L225 Difference]: With dead ends: 732 [2025-03-16 19:34:41,713 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 19:34:41,714 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:34:41,714 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1526 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:41,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 2103 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:41,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 19:34:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2025-03-16 19:34:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3431635388739946) internal successors, (501), 388 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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:34:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 501 transitions. [2025-03-16 19:34:41,720 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 501 transitions. Word has length 74 [2025-03-16 19:34:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:41,720 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 501 transitions. [2025-03-16 19:34:41,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2025-03-16 19:34:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:41,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:41,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:41,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:34:41,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2004090268, now seen corresponding path program 1 times [2025-03-16 19:34:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:41,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339471672] [2025-03-16 19:34:41,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:41,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:41,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:41,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339471672] [2025-03-16 19:34:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339471672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492702881] [2025-03-16 19:34:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:41,922 INFO L87 Difference]: Start difference. First operand 389 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:42,443 INFO L93 Difference]: Finished difference Result 668 states and 873 transitions. [2025-03-16 19:34:42,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:42,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-16 19:34:42,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:42,446 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:34:42,446 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:42,446 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:34:42,447 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 2062 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:42,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 1219 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:42,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3404825737265416) internal successors, (500), 388 states have internal predecessors, (500), 0 states have call successors, (0), 0 states 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:34:42,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 500 transitions. [2025-03-16 19:34:42,453 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 500 transitions. Word has length 74 [2025-03-16 19:34:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:42,453 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 500 transitions. [2025-03-16 19:34:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 500 transitions. [2025-03-16 19:34:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:42,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:42,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:42,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:34:42,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -323173543, now seen corresponding path program 1 times [2025-03-16 19:34:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942803050] [2025-03-16 19:34:42,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:42,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:42,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:42,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:42,638 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:34:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942803050] [2025-03-16 19:34:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942803050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:42,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476947850] [2025-03-16 19:34:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:42,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:42,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:42,639 INFO L87 Difference]: Start difference. First operand 389 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:43,218 INFO L93 Difference]: Finished difference Result 668 states and 871 transitions. [2025-03-16 19:34:43,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:43,219 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:43,221 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:34:43,221 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:43,222 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:34:43,223 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 1052 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:43,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 1545 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3378016085790885) internal successors, (499), 388 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:34:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 499 transitions. [2025-03-16 19:34:43,230 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 499 transitions. Word has length 76 [2025-03-16 19:34:43,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:43,230 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 499 transitions. [2025-03-16 19:34:43,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 499 transitions. [2025-03-16 19:34:43,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:43,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:43,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:43,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:34:43,231 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:43,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:43,232 INFO L85 PathProgramCache]: Analyzing trace with hash 298943791, now seen corresponding path program 1 times [2025-03-16 19:34:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89915398] [2025-03-16 19:34:43,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:43,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:43,444 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:34:43,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:43,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89915398] [2025-03-16 19:34:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89915398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:43,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355364922] [2025-03-16 19:34:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:43,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:43,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:43,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:43,446 INFO L87 Difference]: Start difference. First operand 389 states and 499 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:44,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:44,117 INFO L93 Difference]: Finished difference Result 698 states and 914 transitions. [2025-03-16 19:34:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:44,119 INFO L225 Difference]: With dead ends: 698 [2025-03-16 19:34:44,120 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:44,120 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:34:44,120 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 1513 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:44,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 2300 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3351206434316354) internal successors, (498), 388 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 498 transitions. [2025-03-16 19:34:44,128 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 498 transitions. Word has length 76 [2025-03-16 19:34:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:44,128 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 498 transitions. [2025-03-16 19:34:44,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 498 transitions. [2025-03-16 19:34:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:44,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:44,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:34:44,130 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:44,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:44,130 INFO L85 PathProgramCache]: Analyzing trace with hash 390500235, now seen corresponding path program 1 times [2025-03-16 19:34:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145528643] [2025-03-16 19:34:44,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:44,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:44,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:44,324 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:34:44,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:44,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145528643] [2025-03-16 19:34:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145528643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249787666] [2025-03-16 19:34:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:44,326 INFO L87 Difference]: Start difference. First operand 389 states and 498 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:44,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:44,973 INFO L93 Difference]: Finished difference Result 698 states and 915 transitions. [2025-03-16 19:34:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:44,975 INFO L225 Difference]: With dead ends: 698 [2025-03-16 19:34:44,975 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:44,975 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:34:44,976 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1022 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:44,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 2282 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:44,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3324396782841823) internal successors, (497), 388 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:34:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 497 transitions. [2025-03-16 19:34:44,982 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 497 transitions. Word has length 76 [2025-03-16 19:34:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 497 transitions. [2025-03-16 19:34:44,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 497 transitions. [2025-03-16 19:34:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:44,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:44,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:34:44,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1635260852, now seen corresponding path program 1 times [2025-03-16 19:34:44,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:44,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490964895] [2025-03-16 19:34:44,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:45,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:45,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:45,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:45,151 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:34:45,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:45,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490964895] [2025-03-16 19:34:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490964895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873930958] [2025-03-16 19:34:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:45,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:45,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:45,153 INFO L87 Difference]: Start difference. First operand 389 states and 497 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:45,697 INFO L93 Difference]: Finished difference Result 668 states and 869 transitions. [2025-03-16 19:34:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:45,699 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:34:45,699 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:45,699 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:34:45,699 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 1881 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:45,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 1422 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3297587131367292) internal successors, (496), 388 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:34:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 496 transitions. [2025-03-16 19:34:45,706 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 496 transitions. Word has length 76 [2025-03-16 19:34:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:45,706 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 496 transitions. [2025-03-16 19:34:45,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 496 transitions. [2025-03-16 19:34:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:45,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:45,707 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:45,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:34:45,708 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:45,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2110930711, now seen corresponding path program 1 times [2025-03-16 19:34:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482378287] [2025-03-16 19:34:45,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:45,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:45,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:45,925 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:34:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482378287] [2025-03-16 19:34:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482378287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:45,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:45,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652188945] [2025-03-16 19:34:45,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:45,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:45,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:45,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:45,927 INFO L87 Difference]: Start difference. First operand 389 states and 496 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:46,539 INFO L93 Difference]: Finished difference Result 689 states and 901 transitions. [2025-03-16 19:34:46,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:46,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:46,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:46,540 INFO L225 Difference]: With dead ends: 689 [2025-03-16 19:34:46,540 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:46,541 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:34:46,541 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1506 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:46,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 2093 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:46,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:46,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3270777479892761) internal successors, (495), 388 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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:34:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 495 transitions. [2025-03-16 19:34:46,546 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 495 transitions. Word has length 76 [2025-03-16 19:34:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 495 transitions. [2025-03-16 19:34:46,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 495 transitions. [2025-03-16 19:34:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:46,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:46,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:34:46,548 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 149050576, now seen corresponding path program 1 times [2025-03-16 19:34:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:46,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938254387] [2025-03-16 19:34:46,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:46,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:46,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:46,680 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:34:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938254387] [2025-03-16 19:34:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938254387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678117203] [2025-03-16 19:34:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:46,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:46,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:46,681 INFO L87 Difference]: Start difference. First operand 389 states and 495 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:47,207 INFO L93 Difference]: Finished difference Result 664 states and 863 transitions. [2025-03-16 19:34:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:47,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-16 19:34:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:47,208 INFO L225 Difference]: With dead ends: 664 [2025-03-16 19:34:47,208 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:47,209 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:34:47,209 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1184 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:47,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1490 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.324396782841823) internal successors, (494), 388 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:34:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 494 transitions. [2025-03-16 19:34:47,213 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 494 transitions. Word has length 76 [2025-03-16 19:34:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 494 transitions. [2025-03-16 19:34:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 494 transitions. [2025-03-16 19:34:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:47,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:47,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:34:47,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:47,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:47,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1606847936, now seen corresponding path program 1 times [2025-03-16 19:34:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:47,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811239302] [2025-03-16 19:34:47,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:47,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:47,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:47,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:47,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:47,493 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:34:47,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:47,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811239302] [2025-03-16 19:34:47,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811239302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:47,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:34:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965657708] [2025-03-16 19:34:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:47,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:34:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:47,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:34:47,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:47,495 INFO L87 Difference]: Start difference. First operand 389 states and 494 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:48,542 INFO L93 Difference]: Finished difference Result 946 states and 1270 transitions. [2025-03-16 19:34:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:34:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:48,544 INFO L225 Difference]: With dead ends: 946 [2025-03-16 19:34:48,544 INFO L226 Difference]: Without dead ends: 842 [2025-03-16 19:34:48,545 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:34:48,545 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 3028 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:48,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 2633 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:34:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-16 19:34:48,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 393. [2025-03-16 19:34:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3209549071618036) internal successors, (498), 392 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:48,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 498 transitions. [2025-03-16 19:34:48,550 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 498 transitions. Word has length 78 [2025-03-16 19:34:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:48,550 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 498 transitions. [2025-03-16 19:34:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 10 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 498 transitions. [2025-03-16 19:34:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:48,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:48,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:48,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:34:48,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:48,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1207972898, now seen corresponding path program 1 times [2025-03-16 19:34:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:48,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234425479] [2025-03-16 19:34:48,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:48,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:48,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:48,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:48,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:48,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:48,683 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:34:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234425479] [2025-03-16 19:34:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234425479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339040744] [2025-03-16 19:34:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:48,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:48,684 INFO L87 Difference]: Start difference. First operand 393 states and 498 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:49,144 INFO L93 Difference]: Finished difference Result 677 states and 874 transitions. [2025-03-16 19:34:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:49,145 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:49,146 INFO L225 Difference]: With dead ends: 677 [2025-03-16 19:34:49,146 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:49,146 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:34:49,147 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1803 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:49,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 1490 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3183023872679045) internal successors, (497), 392 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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:34:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 497 transitions. [2025-03-16 19:34:49,151 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 497 transitions. Word has length 78 [2025-03-16 19:34:49,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:49,151 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 497 transitions. [2025-03-16 19:34:49,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:49,151 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 497 transitions. [2025-03-16 19:34:49,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:49,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:49,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:49,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:34:49,152 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash 511748996, now seen corresponding path program 1 times [2025-03-16 19:34:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882252740] [2025-03-16 19:34:49,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:49,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:49,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:49,308 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:34:49,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:49,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882252740] [2025-03-16 19:34:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882252740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:49,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125811859] [2025-03-16 19:34:49,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:49,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:49,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:49,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:49,310 INFO L87 Difference]: Start difference. First operand 393 states and 497 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:49,812 INFO L93 Difference]: Finished difference Result 649 states and 832 transitions. [2025-03-16 19:34:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:49,814 INFO L225 Difference]: With dead ends: 649 [2025-03-16 19:34:49,814 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:49,816 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:34:49,816 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 1550 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:49,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 1648 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3156498673740054) internal successors, (496), 392 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:34:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 496 transitions. [2025-03-16 19:34:49,820 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 496 transitions. Word has length 78 [2025-03-16 19:34:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 496 transitions. [2025-03-16 19:34:49,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 496 transitions. [2025-03-16 19:34:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:49,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:49,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:49,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:34:49,822 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:49,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1622981709, now seen corresponding path program 1 times [2025-03-16 19:34:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977454389] [2025-03-16 19:34:49,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:49,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:49,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:49,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:49,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:49,955 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:34:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977454389] [2025-03-16 19:34:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977454389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:49,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853835579] [2025-03-16 19:34:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:49,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:49,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:49,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:49,957 INFO L87 Difference]: Start difference. First operand 393 states and 496 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:50,398 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2025-03-16 19:34:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:50,400 INFO L225 Difference]: With dead ends: 613 [2025-03-16 19:34:50,400 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:50,400 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:34:50,401 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1797 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:50,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1797 Valid, 1475 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.312997347480106) internal successors, (495), 392 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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:34:50,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 495 transitions. [2025-03-16 19:34:50,405 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 495 transitions. Word has length 78 [2025-03-16 19:34:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:50,405 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 495 transitions. [2025-03-16 19:34:50,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:50,405 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 495 transitions. [2025-03-16 19:34:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:50,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:50,405 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:50,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:34:50,406 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 926757807, now seen corresponding path program 1 times [2025-03-16 19:34:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473090452] [2025-03-16 19:34:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:50,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:50,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:50,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:50,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:50,562 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:34:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:50,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473090452] [2025-03-16 19:34:50,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473090452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:50,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:50,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:50,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269562196] [2025-03-16 19:34:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:50,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:50,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:50,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:50,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:50,564 INFO L87 Difference]: Start difference. First operand 393 states and 495 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:51,130 INFO L93 Difference]: Finished difference Result 585 states and 734 transitions. [2025-03-16 19:34:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:51,132 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:34:51,132 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:51,132 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:34:51,132 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1542 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:51,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1700 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:51,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3103448275862069) internal successors, (494), 392 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:34:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 494 transitions. [2025-03-16 19:34:51,137 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 494 transitions. Word has length 78 [2025-03-16 19:34:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:51,138 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 494 transitions. [2025-03-16 19:34:51,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 494 transitions. [2025-03-16 19:34:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:51,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:51,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:34:51,139 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:51,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1169309221, now seen corresponding path program 1 times [2025-03-16 19:34:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:51,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948931132] [2025-03-16 19:34:51,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:51,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:51,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:51,313 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:34:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948931132] [2025-03-16 19:34:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948931132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365947728] [2025-03-16 19:34:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:51,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:51,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:51,315 INFO L87 Difference]: Start difference. First operand 393 states and 494 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:51,756 INFO L93 Difference]: Finished difference Result 646 states and 826 transitions. [2025-03-16 19:34:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:51,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:51,758 INFO L225 Difference]: With dead ends: 646 [2025-03-16 19:34:51,758 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:51,758 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:34:51,759 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1667 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:51,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1537 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3076923076923077) internal successors, (493), 392 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:34:51,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 493 transitions. [2025-03-16 19:34:51,763 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 493 transitions. Word has length 78 [2025-03-16 19:34:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 493 transitions. [2025-03-16 19:34:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 493 transitions. [2025-03-16 19:34:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:51,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:51,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:51,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:34:51,763 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:51,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -839317818, now seen corresponding path program 1 times [2025-03-16 19:34:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:51,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291599616] [2025-03-16 19:34:51,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:51,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:51,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:51,883 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:34:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291599616] [2025-03-16 19:34:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291599616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:51,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:51,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884549835] [2025-03-16 19:34:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:51,885 INFO L87 Difference]: Start difference. First operand 393 states and 493 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:52,357 INFO L93 Difference]: Finished difference Result 585 states and 732 transitions. [2025-03-16 19:34:52,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:52,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:52,359 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:34:52,359 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:52,359 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:34:52,360 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1135 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:52,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1522 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:52,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3050397877984086) internal successors, (492), 392 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:34:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 492 transitions. [2025-03-16 19:34:52,364 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 492 transitions. Word has length 78 [2025-03-16 19:34:52,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:52,364 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 492 transitions. [2025-03-16 19:34:52,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 492 transitions. [2025-03-16 19:34:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:52,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:52,365 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:34:52,365 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1634570779, now seen corresponding path program 1 times [2025-03-16 19:34:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:52,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179591095] [2025-03-16 19:34:52,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:52,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:52,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:52,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:52,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179591095] [2025-03-16 19:34:52,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179591095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:52,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:52,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067213259] [2025-03-16 19:34:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:52,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:52,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:52,517 INFO L87 Difference]: Start difference. First operand 393 states and 492 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:52,969 INFO L93 Difference]: Finished difference Result 649 states and 826 transitions. [2025-03-16 19:34:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:52,973 INFO L225 Difference]: With dead ends: 649 [2025-03-16 19:34:52,973 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:52,974 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:34:52,974 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1212 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:52,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1368 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:52,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3023872679045092) internal successors, (491), 392 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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:34:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 491 transitions. [2025-03-16 19:34:52,978 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 491 transitions. Word has length 78 [2025-03-16 19:34:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:52,978 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 491 transitions. [2025-03-16 19:34:52,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 491 transitions. [2025-03-16 19:34:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:52,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:52,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:52,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:34:52,979 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:52,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:52,980 INFO L85 PathProgramCache]: Analyzing trace with hash 539491270, now seen corresponding path program 1 times [2025-03-16 19:34:52,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:52,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262882175] [2025-03-16 19:34:52,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:52,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:52,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:52,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,096 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:34:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:53,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262882175] [2025-03-16 19:34:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262882175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:53,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:53,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:53,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372193335] [2025-03-16 19:34:53,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:53,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:53,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:53,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:53,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:53,098 INFO L87 Difference]: Start difference. First operand 393 states and 491 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:53,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:53,512 INFO L93 Difference]: Finished difference Result 646 states and 821 transitions. [2025-03-16 19:34:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:53,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:53,513 INFO L225 Difference]: With dead ends: 646 [2025-03-16 19:34:53,513 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:53,514 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:34:53,514 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1815 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:53,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 1379 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.29973474801061) internal successors, (490), 392 states have internal predecessors, (490), 0 states have call successors, (0), 0 states 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:34:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 490 transitions. [2025-03-16 19:34:53,518 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 490 transitions. Word has length 78 [2025-03-16 19:34:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:53,518 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 490 transitions. [2025-03-16 19:34:53,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 490 transitions. [2025-03-16 19:34:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:53,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:53,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:34:53,519 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:53,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash 2015114453, now seen corresponding path program 1 times [2025-03-16 19:34:53,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:53,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512150759] [2025-03-16 19:34:53,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:53,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:53,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:53,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:53,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,645 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:34:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:53,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512150759] [2025-03-16 19:34:53,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512150759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:53,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:53,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510690854] [2025-03-16 19:34:53,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:53,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:53,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:53,647 INFO L87 Difference]: Start difference. First operand 393 states and 490 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:54,117 INFO L93 Difference]: Finished difference Result 677 states and 864 transitions. [2025-03-16 19:34:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:54,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:54,119 INFO L225 Difference]: With dead ends: 677 [2025-03-16 19:34:54,119 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:54,119 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:34:54,119 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1614 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:54,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 1645 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:54,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.297082228116711) internal successors, (489), 392 states have internal predecessors, (489), 0 states have call successors, (0), 0 states 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:34:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 489 transitions. [2025-03-16 19:34:54,123 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 489 transitions. Word has length 78 [2025-03-16 19:34:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:54,124 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 489 transitions. [2025-03-16 19:34:54,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 489 transitions. [2025-03-16 19:34:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:54,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:54,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:34:54,125 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash 294093687, now seen corresponding path program 1 times [2025-03-16 19:34:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:54,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56777060] [2025-03-16 19:34:54,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:54,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:54,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:54,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:54,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:54,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:54,260 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:34:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56777060] [2025-03-16 19:34:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56777060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483604619] [2025-03-16 19:34:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:54,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:54,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:54,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:54,262 INFO L87 Difference]: Start difference. First operand 393 states and 489 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:54,664 INFO L93 Difference]: Finished difference Result 649 states and 822 transitions. [2025-03-16 19:34:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:54,665 INFO L225 Difference]: With dead ends: 649 [2025-03-16 19:34:54,665 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:54,666 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:34:54,666 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1492 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:54,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1467 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 392 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:34:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 488 transitions. [2025-03-16 19:34:54,669 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 488 transitions. Word has length 78 [2025-03-16 19:34:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:54,670 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 488 transitions. [2025-03-16 19:34:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 488 transitions. [2025-03-16 19:34:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:54,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:54,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:54,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:34:54,670 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:54,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 653359115, now seen corresponding path program 1 times [2025-03-16 19:34:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:54,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122776457] [2025-03-16 19:34:54,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:54,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:54,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:54,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:54,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:54,794 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:34:54,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:54,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122776457] [2025-03-16 19:34:54,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122776457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:54,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:54,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818948461] [2025-03-16 19:34:54,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:54,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:54,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:54,795 INFO L87 Difference]: Start difference. First operand 393 states and 488 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:55,163 INFO L93 Difference]: Finished difference Result 585 states and 725 transitions. [2025-03-16 19:34:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:55,164 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:34:55,164 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:55,165 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:34:55,165 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1489 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 1449 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:55,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2917771883289124) internal successors, (487), 392 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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:34:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 487 transitions. [2025-03-16 19:34:55,169 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 487 transitions. Word has length 78 [2025-03-16 19:34:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:55,169 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 487 transitions. [2025-03-16 19:34:55,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 487 transitions. [2025-03-16 19:34:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:55,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:55,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:55,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:34:55,170 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:55,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1238764730, now seen corresponding path program 1 times [2025-03-16 19:34:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107023807] [2025-03-16 19:34:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:55,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:55,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:55,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:55,328 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:34:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:55,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107023807] [2025-03-16 19:34:55,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107023807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:55,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:55,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681523916] [2025-03-16 19:34:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:55,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:55,330 INFO L87 Difference]: Start difference. First operand 393 states and 487 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:55,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:55,817 INFO L93 Difference]: Finished difference Result 646 states and 816 transitions. [2025-03-16 19:34:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:55,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:55,819 INFO L225 Difference]: With dead ends: 646 [2025-03-16 19:34:55,819 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:55,819 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:34:55,819 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1516 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:55,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1974 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:55,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 392 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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:34:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 486 transitions. [2025-03-16 19:34:55,824 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 486 transitions. Word has length 78 [2025-03-16 19:34:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:55,824 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 486 transitions. [2025-03-16 19:34:55,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 486 transitions. [2025-03-16 19:34:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:55,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:55,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:34:55,825 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:55,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1702267267, now seen corresponding path program 1 times [2025-03-16 19:34:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:55,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361896617] [2025-03-16 19:34:55,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:55,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:55,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:55,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:55,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361896617] [2025-03-16 19:34:55,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361896617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:55,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:55,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254843922] [2025-03-16 19:34:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:55,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:55,950 INFO L87 Difference]: Start difference. First operand 393 states and 486 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:56,373 INFO L93 Difference]: Finished difference Result 646 states and 815 transitions. [2025-03-16 19:34:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:56,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-16 19:34:56,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:56,374 INFO L225 Difference]: With dead ends: 646 [2025-03-16 19:34:56,374 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:56,375 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:34:56,375 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 1180 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:56,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1420 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 392 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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:34:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2025-03-16 19:34:56,379 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 78 [2025-03-16 19:34:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:56,379 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2025-03-16 19:34:56,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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:34:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2025-03-16 19:34:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:56,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:56,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:34:56,380 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:56,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1669373744, now seen corresponding path program 1 times [2025-03-16 19:34:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:56,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793474434] [2025-03-16 19:34:56,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:56,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:56,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:56,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:56,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:56,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:56,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:56,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793474434] [2025-03-16 19:34:56,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793474434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:56,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295711858] [2025-03-16 19:34:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:56,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:56,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:56,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:56,516 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:57,068 INFO L93 Difference]: Finished difference Result 704 states and 894 transitions. [2025-03-16 19:34:57,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:57,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:34:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:57,069 INFO L225 Difference]: With dead ends: 704 [2025-03-16 19:34:57,069 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:57,070 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:34:57,070 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1085 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:57,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1676 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.2868632707774799) internal successors, (480), 388 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:34:57,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 480 transitions. [2025-03-16 19:34:57,074 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 480 transitions. Word has length 79 [2025-03-16 19:34:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:57,074 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 480 transitions. [2025-03-16 19:34:57,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 480 transitions. [2025-03-16 19:34:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:57,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:57,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:57,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:34:57,075 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:57,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2143553240, now seen corresponding path program 1 times [2025-03-16 19:34:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669821265] [2025-03-16 19:34:57,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:57,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:57,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:57,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:57,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:57,229 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:34:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669821265] [2025-03-16 19:34:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669821265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:57,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025201976] [2025-03-16 19:34:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:57,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:57,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:57,245 INFO L87 Difference]: Start difference. First operand 389 states and 480 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:57,786 INFO L93 Difference]: Finished difference Result 640 states and 806 transitions. [2025-03-16 19:34:57,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-16 19:34:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:57,789 INFO L225 Difference]: With dead ends: 640 [2025-03-16 19:34:57,789 INFO L226 Difference]: Without dead ends: 575 [2025-03-16 19:34:57,790 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:34:57,790 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1505 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:57,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1748 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-16 19:34:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 388. [2025-03-16 19:34:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 372 states have (on average 1.2849462365591398) internal successors, (478), 387 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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:34:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 478 transitions. [2025-03-16 19:34:57,797 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 478 transitions. Word has length 79 [2025-03-16 19:34:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:57,797 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 478 transitions. [2025-03-16 19:34:57,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 478 transitions. [2025-03-16 19:34:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:34:57,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:57,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:57,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:34:57,799 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1323154137, now seen corresponding path program 1 times [2025-03-16 19:34:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639376484] [2025-03-16 19:34:57,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:57,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:34:57,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:34:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:58,199 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:34:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639376484] [2025-03-16 19:34:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639376484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:34:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446887874] [2025-03-16 19:34:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:58,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:34:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:58,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:34:58,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:58,201 INFO L87 Difference]: Start difference. First operand 388 states and 478 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:34:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:58,974 INFO L93 Difference]: Finished difference Result 954 states and 1207 transitions. [2025-03-16 19:34:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:34:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:34:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:58,976 INFO L225 Difference]: With dead ends: 954 [2025-03-16 19:34:58,976 INFO L226 Difference]: Without dead ends: 874 [2025-03-16 19:34:58,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:34:58,977 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 2418 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 4950 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:58,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2418 Valid, 4950 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-03-16 19:34:58,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 372. [2025-03-16 19:34:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 358 states have (on average 1.282122905027933) internal successors, (459), 371 states have internal predecessors, (459), 0 states have call successors, (0), 0 states 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:34:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 459 transitions. [2025-03-16 19:34:58,981 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 459 transitions. Word has length 80 [2025-03-16 19:34:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:58,981 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 459 transitions. [2025-03-16 19:34:58,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:34:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 459 transitions. [2025-03-16 19:34:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:34:58,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:58,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:34:58,982 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1264632038, now seen corresponding path program 1 times [2025-03-16 19:34:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582240434] [2025-03-16 19:34:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:58,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:34:59,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:34:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582240434] [2025-03-16 19:34:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582240434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:34:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755040262] [2025-03-16 19:34:59,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:34:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:59,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:34:59,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:59,313 INFO L87 Difference]: Start difference. First operand 372 states and 459 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:34:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:59,736 INFO L93 Difference]: Finished difference Result 596 states and 765 transitions. [2025-03-16 19:34:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:59,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:34:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:59,738 INFO L225 Difference]: With dead ends: 596 [2025-03-16 19:34:59,738 INFO L226 Difference]: Without dead ends: 499 [2025-03-16 19:34:59,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:34:59,739 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 2207 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:59,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 2189 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-16 19:34:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 339. [2025-03-16 19:34:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.2774390243902438) internal successors, (419), 338 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:34:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 419 transitions. [2025-03-16 19:34:59,742 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 419 transitions. Word has length 80 [2025-03-16 19:34:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 419 transitions. [2025-03-16 19:34:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:34:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 419 transitions. [2025-03-16 19:34:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:34:59,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:59,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:59,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:34:59,743 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:59,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1873179611, now seen corresponding path program 1 times [2025-03-16 19:34:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:59,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604339571] [2025-03-16 19:34:59,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:59,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:34:59,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:34:59,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:00,409 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:35:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604339571] [2025-03-16 19:35:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604339571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 19:35:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988719966] [2025-03-16 19:35:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:35:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:00,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:35:00,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:35:00,411 INFO L87 Difference]: Start difference. First operand 339 states and 419 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:01,352 INFO L93 Difference]: Finished difference Result 738 states and 947 transitions. [2025-03-16 19:35:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:35:01,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:35:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:01,354 INFO L225 Difference]: With dead ends: 738 [2025-03-16 19:35:01,354 INFO L226 Difference]: Without dead ends: 615 [2025-03-16 19:35:01,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2025-03-16 19:35:01,355 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2066 mSDsluCounter, 5371 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:01,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 5968 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:35:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-03-16 19:35:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 315. [2025-03-16 19:35:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 305 states have (on average 1.2721311475409836) internal successors, (388), 314 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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:35:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 388 transitions. [2025-03-16 19:35:01,358 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 388 transitions. Word has length 80 [2025-03-16 19:35:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:01,359 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 388 transitions. [2025-03-16 19:35:01,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 388 transitions. [2025-03-16 19:35:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:35:01,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:01,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:35:01,360 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash 459065825, now seen corresponding path program 1 times [2025-03-16 19:35:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:01,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959666159] [2025-03-16 19:35:01,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:01,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:35:01,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:35:01,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:01,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:02,605 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:35:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959666159] [2025-03-16 19:35:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959666159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:02,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:02,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-16 19:35:02,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466278211] [2025-03-16 19:35:02,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:02,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:35:02,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:02,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:35:02,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:35:02,608 INFO L87 Difference]: Start difference. First operand 315 states and 388 transitions. Second operand has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:06,595 INFO L93 Difference]: Finished difference Result 1120 states and 1432 transitions. [2025-03-16 19:35:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 19:35:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:35:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:06,598 INFO L225 Difference]: With dead ends: 1120 [2025-03-16 19:35:06,598 INFO L226 Difference]: Without dead ends: 1049 [2025-03-16 19:35:06,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 19:35:06,599 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 3653 mSDsluCounter, 12606 mSDsCounter, 0 mSdLazyCounter, 7489 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3653 SdHoareTripleChecker+Valid, 13466 SdHoareTripleChecker+Invalid, 7491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:06,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3653 Valid, 13466 Invalid, 7491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7489 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 19:35:06,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-03-16 19:35:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 330. [2025-03-16 19:35:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 320 states have (on average 1.26875) internal successors, (406), 329 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:35:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 406 transitions. [2025-03-16 19:35:06,602 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 406 transitions. Word has length 80 [2025-03-16 19:35:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:06,602 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 406 transitions. [2025-03-16 19:35:06,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.857142857142857) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 406 transitions. [2025-03-16 19:35:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:35:06,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:06,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:35:06,603 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1911470, now seen corresponding path program 1 times [2025-03-16 19:35:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391040459] [2025-03-16 19:35:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:06,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:35:06,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:35:06,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:06,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:06,878 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:35:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:06,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391040459] [2025-03-16 19:35:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391040459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:06,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:35:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237393815] [2025-03-16 19:35:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:06,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:35:06,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:06,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:35:06,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:06,879 INFO L87 Difference]: Start difference. First operand 330 states and 406 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:07,257 INFO L93 Difference]: Finished difference Result 704 states and 911 transitions. [2025-03-16 19:35:07,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:35:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-16 19:35:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:07,259 INFO L225 Difference]: With dead ends: 704 [2025-03-16 19:35:07,259 INFO L226 Difference]: Without dead ends: 508 [2025-03-16 19:35:07,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:35:07,260 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 979 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:07,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2256 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-16 19:35:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 198. [2025-03-16 19:35:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.2487046632124352) internal successors, (241), 197 states have internal predecessors, (241), 0 states have call successors, (0), 0 states 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:35:07,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 241 transitions. [2025-03-16 19:35:07,262 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 241 transitions. Word has length 80 [2025-03-16 19:35:07,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:07,262 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 241 transitions. [2025-03-16 19:35:07,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:35:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 241 transitions. [2025-03-16 19:35:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:35:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:07,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:07,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:35:07,263 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:07,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:07,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1347584129, now seen corresponding path program 1 times [2025-03-16 19:35:07,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:07,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241024015] [2025-03-16 19:35:07,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:07,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:35:07,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:35:07,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:07,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241024015] [2025-03-16 19:35:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241024015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185379632] [2025-03-16 19:35:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:07,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:07,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:07,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:07,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:07,410 INFO L87 Difference]: Start difference. First operand 198 states and 241 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:07,699 INFO L93 Difference]: Finished difference Result 371 states and 482 transitions. [2025-03-16 19:35:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:35:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:35:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:07,700 INFO L225 Difference]: With dead ends: 371 [2025-03-16 19:35:07,700 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 19:35:07,701 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:35:07,701 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 922 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:07,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 641 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 19:35:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 198. [2025-03-16 19:35:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 193 states have (on average 1.2435233160621761) internal successors, (240), 197 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:35:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 240 transitions. [2025-03-16 19:35:07,703 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 240 transitions. Word has length 81 [2025-03-16 19:35:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:07,703 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 240 transitions. [2025-03-16 19:35:07,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 240 transitions. [2025-03-16 19:35:07,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:35:07,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:07,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:07,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:35:07,704 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:07,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash -434833848, now seen corresponding path program 1 times [2025-03-16 19:35:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:07,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840743603] [2025-03-16 19:35:07,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:07,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:35:07,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:35:07,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:07,980 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:35:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840743603] [2025-03-16 19:35:07,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840743603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:07,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:07,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:35:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087386557] [2025-03-16 19:35:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:07,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:35:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:07,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:35:07,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:35:07,981 INFO L87 Difference]: Start difference. First operand 198 states and 240 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:08,316 INFO L93 Difference]: Finished difference Result 295 states and 372 transitions. [2025-03-16 19:35:08,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:08,317 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:35:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:08,317 INFO L225 Difference]: With dead ends: 295 [2025-03-16 19:35:08,317 INFO L226 Difference]: Without dead ends: 291 [2025-03-16 19:35:08,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:35:08,318 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1062 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:08,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1338 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-16 19:35:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 194. [2025-03-16 19:35:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 193 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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:35:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 236 transitions. [2025-03-16 19:35:08,320 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 236 transitions. Word has length 81 [2025-03-16 19:35:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:08,320 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 236 transitions. [2025-03-16 19:35:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 236 transitions. [2025-03-16 19:35:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:35:08,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:08,320 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:35:08,321 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2068801211, now seen corresponding path program 1 times [2025-03-16 19:35:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:08,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315301158] [2025-03-16 19:35:08,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:08,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:35:08,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:35:08,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:08,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:08,633 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:35:08,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:08,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315301158] [2025-03-16 19:35:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315301158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:35:08,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303188737] [2025-03-16 19:35:08,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:08,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:35:08,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:08,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:35:08,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:35:08,634 INFO L87 Difference]: Start difference. First operand 194 states and 236 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:09,118 INFO L93 Difference]: Finished difference Result 527 states and 701 transitions. [2025-03-16 19:35:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:09,118 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-16 19:35:09,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:09,119 INFO L225 Difference]: With dead ends: 527 [2025-03-16 19:35:09,119 INFO L226 Difference]: Without dead ends: 452 [2025-03-16 19:35:09,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:35:09,120 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 996 mSDsluCounter, 3321 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 3848 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:09,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 3848 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-16 19:35:09,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 183. [2025-03-16 19:35:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 180 states have (on average 1.238888888888889) internal successors, (223), 182 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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:35:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 223 transitions. [2025-03-16 19:35:09,122 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 223 transitions. Word has length 81 [2025-03-16 19:35:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:09,122 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 223 transitions. [2025-03-16 19:35:09,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 223 transitions. [2025-03-16 19:35:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:35:09,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:09,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:09,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:35:09,122 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash 81985151, now seen corresponding path program 1 times [2025-03-16 19:35:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788436918] [2025-03-16 19:35:09,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:09,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:09,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:35:09,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:35:09,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:09,337 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:35:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788436918] [2025-03-16 19:35:09,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788436918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:09,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:09,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:35:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666417733] [2025-03-16 19:35:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:35:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:09,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:35:09,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:09,338 INFO L87 Difference]: Start difference. First operand 183 states and 223 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:09,807 INFO L93 Difference]: Finished difference Result 451 states and 598 transitions. [2025-03-16 19:35:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:35:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:35:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:09,808 INFO L225 Difference]: With dead ends: 451 [2025-03-16 19:35:09,808 INFO L226 Difference]: Without dead ends: 444 [2025-03-16 19:35:09,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:35:09,809 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1741 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:09,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 1065 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:35:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-16 19:35:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 187. [2025-03-16 19:35:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 184 states have (on average 1.233695652173913) internal successors, (227), 186 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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:35:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2025-03-16 19:35:09,811 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 82 [2025-03-16 19:35:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:09,811 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2025-03-16 19:35:09,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:09,811 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2025-03-16 19:35:09,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:35:09,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:09,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:09,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:35:09,812 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:09,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash -333540994, now seen corresponding path program 1 times [2025-03-16 19:35:09,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:09,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491808383] [2025-03-16 19:35:09,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:09,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:35:09,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:35:09,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:09,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:10,095 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:35:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491808383] [2025-03-16 19:35:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491808383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:10,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:35:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901398663] [2025-03-16 19:35:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:10,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:35:10,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:10,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:35:10,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:35:10,097 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:10,410 INFO L93 Difference]: Finished difference Result 274 states and 348 transitions. [2025-03-16 19:35:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:10,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:35:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:10,411 INFO L225 Difference]: With dead ends: 274 [2025-03-16 19:35:10,411 INFO L226 Difference]: Without dead ends: 268 [2025-03-16 19:35:10,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:35:10,411 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 999 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:10,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1567 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-16 19:35:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 181. [2025-03-16 19:35:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.23463687150838) internal successors, (221), 180 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:35:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 221 transitions. [2025-03-16 19:35:10,413 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 221 transitions. Word has length 83 [2025-03-16 19:35:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:10,413 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 221 transitions. [2025-03-16 19:35:10,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 221 transitions. [2025-03-16 19:35:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:35:10,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:10,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:10,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:35:10,414 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -175491578, now seen corresponding path program 1 times [2025-03-16 19:35:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74363675] [2025-03-16 19:35:10,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:10,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:35:10,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:35:10,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:10,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:10,537 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:35:10,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:10,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74363675] [2025-03-16 19:35:10,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74363675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:10,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:10,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:10,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975590367] [2025-03-16 19:35:10,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:10,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:35:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:10,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:35:10,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:35:10,538 INFO L87 Difference]: Start difference. First operand 181 states and 221 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:10,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:10,755 INFO L93 Difference]: Finished difference Result 277 states and 349 transitions. [2025-03-16 19:35:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:35:10,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-16 19:35:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:10,756 INFO L225 Difference]: With dead ends: 277 [2025-03-16 19:35:10,756 INFO L226 Difference]: Without dead ends: 270 [2025-03-16 19:35:10,756 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:35:10,756 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 621 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:10,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 859 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:35:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-16 19:35:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 177. [2025-03-16 19:35:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.2342857142857142) internal successors, (216), 176 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:35:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 216 transitions. [2025-03-16 19:35:10,758 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 216 transitions. Word has length 83 [2025-03-16 19:35:10,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:10,758 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 216 transitions. [2025-03-16 19:35:10,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:10,758 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 216 transitions. [2025-03-16 19:35:10,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:35:10,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:10,759 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:10,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:35:10,759 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:10,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash -856319665, now seen corresponding path program 1 times [2025-03-16 19:35:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:10,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812113099] [2025-03-16 19:35:10,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:10,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:35:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:35:10,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:11,016 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:35:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812113099] [2025-03-16 19:35:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812113099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:35:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543819997] [2025-03-16 19:35:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:35:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:35:11,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:35:11,017 INFO L87 Difference]: Start difference. First operand 177 states and 216 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:11,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:11,324 INFO L93 Difference]: Finished difference Result 272 states and 348 transitions. [2025-03-16 19:35:11,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:35:11,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-16 19:35:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:11,325 INFO L225 Difference]: With dead ends: 272 [2025-03-16 19:35:11,325 INFO L226 Difference]: Without dead ends: 248 [2025-03-16 19:35:11,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:35:11,325 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 716 mSDsluCounter, 1429 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:11,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1705 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-16 19:35:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 153. [2025-03-16 19:35:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.25) internal successors, (190), 152 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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:35:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 190 transitions. [2025-03-16 19:35:11,327 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 190 transitions. Word has length 84 [2025-03-16 19:35:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 190 transitions. [2025-03-16 19:35:11,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 11 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 190 transitions. [2025-03-16 19:35:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:35:11,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:11,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:11,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:35:11,328 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:11,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1536614428, now seen corresponding path program 1 times [2025-03-16 19:35:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562758752] [2025-03-16 19:35:11,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:35:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:35:11,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:11,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:11,405 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:35:11,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:11,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562758752] [2025-03-16 19:35:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562758752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:11,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:11,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087129539] [2025-03-16 19:35:11,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:11,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:11,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:11,406 INFO L87 Difference]: Start difference. First operand 153 states and 190 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:11,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:11,501 INFO L93 Difference]: Finished difference Result 793 states and 1140 transitions. [2025-03-16 19:35:11,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:35:11,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:35:11,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:11,503 INFO L225 Difference]: With dead ends: 793 [2025-03-16 19:35:11,503 INFO L226 Difference]: Without dead ends: 729 [2025-03-16 19:35:11,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:35:11,503 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1246 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:11,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1836 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-03-16 19:35:11,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 215. [2025-03-16 19:35:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 1.3177570093457944) internal successors, (282), 214 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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:35:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2025-03-16 19:35:11,507 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 110 [2025-03-16 19:35:11,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:11,507 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2025-03-16 19:35:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2025-03-16 19:35:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:11,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:11,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:11,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:35:11,507 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1303743136, now seen corresponding path program 1 times [2025-03-16 19:35:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:11,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239469573] [2025-03-16 19:35:11,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:11,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:11,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:11,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:11,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:11,595 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:35:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239469573] [2025-03-16 19:35:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239469573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:11,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:11,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:11,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259269988] [2025-03-16 19:35:11,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:11,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:11,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:11,596 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand has 7 states, 7 states have (on average 16.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:35:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:11,682 INFO L93 Difference]: Finished difference Result 909 states and 1310 transitions. [2025-03-16 19:35:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:11,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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:35:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:11,684 INFO L225 Difference]: With dead ends: 909 [2025-03-16 19:35:11,684 INFO L226 Difference]: Without dead ends: 783 [2025-03-16 19:35:11,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:11,685 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 947 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:11,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1166 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-16 19:35:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 339. [2025-03-16 19:35:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 338 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:35:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 467 transitions. [2025-03-16 19:35:11,689 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 467 transitions. Word has length 112 [2025-03-16 19:35:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:11,689 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 467 transitions. [2025-03-16 19:35:11,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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:35:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 467 transitions. [2025-03-16 19:35:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:11,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:11,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:11,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:35:11,690 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash 288625888, now seen corresponding path program 1 times [2025-03-16 19:35:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315698283] [2025-03-16 19:35:11,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:11,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:11,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:11,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:11,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:11,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:11,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315698283] [2025-03-16 19:35:11,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315698283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:11,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:11,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:11,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86022082] [2025-03-16 19:35:11,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:11,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:11,769 INFO L87 Difference]: Start difference. First operand 339 states and 467 transitions. Second operand has 7 states, 7 states have (on average 16.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:35:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:11,842 INFO L93 Difference]: Finished difference Result 1033 states and 1495 transitions. [2025-03-16 19:35:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:11,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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:35:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:11,844 INFO L225 Difference]: With dead ends: 1033 [2025-03-16 19:35:11,844 INFO L226 Difference]: Without dead ends: 907 [2025-03-16 19:35:11,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:11,845 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 986 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:11,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1087 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-03-16 19:35:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 525. [2025-03-16 19:35:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.4198473282442747) internal successors, (744), 524 states have internal predecessors, (744), 0 states have call successors, (0), 0 states 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:35:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 744 transitions. [2025-03-16 19:35:11,850 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 744 transitions. Word has length 112 [2025-03-16 19:35:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:11,850 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 744 transitions. [2025-03-16 19:35:11,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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:35:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 744 transitions. [2025-03-16 19:35:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:11,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:11,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:11,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 19:35:11,851 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:11,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:11,851 INFO L85 PathProgramCache]: Analyzing trace with hash 340980832, now seen corresponding path program 1 times [2025-03-16 19:35:11,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:11,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499152638] [2025-03-16 19:35:11,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:11,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:11,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:11,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:11,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:11,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:11,928 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:35:11,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:11,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499152638] [2025-03-16 19:35:11,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499152638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:11,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:11,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:11,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708996486] [2025-03-16 19:35:11,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:11,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:11,929 INFO L87 Difference]: Start difference. First operand 525 states and 744 transitions. Second operand has 7 states, 7 states have (on average 16.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:35:11,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:11,993 INFO L93 Difference]: Finished difference Result 1157 states and 1680 transitions. [2025-03-16 19:35:11,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:11,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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:35:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:11,995 INFO L225 Difference]: With dead ends: 1157 [2025-03-16 19:35:11,995 INFO L226 Difference]: Without dead ends: 1031 [2025-03-16 19:35:11,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:11,996 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 1041 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:11,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1061 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2025-03-16 19:35:12,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 649. [2025-03-16 19:35:12,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.433641975308642) internal successors, (929), 648 states have internal predecessors, (929), 0 states have call successors, (0), 0 states 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:35:12,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 929 transitions. [2025-03-16 19:35:12,002 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 929 transitions. Word has length 112 [2025-03-16 19:35:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,002 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 929 transitions. [2025-03-16 19:35:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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:35:12,003 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 929 transitions. [2025-03-16 19:35:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:12,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 19:35:12,003 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1291754464, now seen corresponding path program 1 times [2025-03-16 19:35:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58787887] [2025-03-16 19:35:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:12,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:12,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,084 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:35:12,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58787887] [2025-03-16 19:35:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58787887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767465116] [2025-03-16 19:35:12,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:12,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:12,085 INFO L87 Difference]: Start difference. First operand 649 states and 929 transitions. Second operand has 7 states, 7 states have (on average 16.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:35:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,151 INFO L93 Difference]: Finished difference Result 1281 states and 1865 transitions. [2025-03-16 19:35:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:12,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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:35:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,153 INFO L225 Difference]: With dead ends: 1281 [2025-03-16 19:35:12,153 INFO L226 Difference]: Without dead ends: 1155 [2025-03-16 19:35:12,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:12,154 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 971 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1161 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-03-16 19:35:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 773. [2025-03-16 19:35:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4430051813471503) internal successors, (1114), 772 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states 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:35:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1114 transitions. [2025-03-16 19:35:12,161 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1114 transitions. Word has length 112 [2025-03-16 19:35:12,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,161 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1114 transitions. [2025-03-16 19:35:12,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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:35:12,161 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1114 transitions. [2025-03-16 19:35:12,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:12,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,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, 1] [2025-03-16 19:35:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 19:35:12,161 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,162 INFO L85 PathProgramCache]: Analyzing trace with hash 791246140, now seen corresponding path program 1 times [2025-03-16 19:35:12,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382202228] [2025-03-16 19:35:12,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:12,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:12,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,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:35:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382202228] [2025-03-16 19:35:12,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382202228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:12,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155006361] [2025-03-16 19:35:12,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:12,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:12,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,197 INFO L87 Difference]: Start difference. First operand 773 states and 1114 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:35:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,216 INFO L93 Difference]: Finished difference Result 2070 states and 3027 transitions. [2025-03-16 19:35:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:35:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,218 INFO L225 Difference]: With dead ends: 2070 [2025-03-16 19:35:12,218 INFO L226 Difference]: Without dead ends: 1386 [2025-03-16 19:35:12,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,219 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 110 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 305 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2025-03-16 19:35:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1373. [2025-03-16 19:35:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1372 states have (on average 1.434402332361516) internal successors, (1968), 1372 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states 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:35:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1968 transitions. [2025-03-16 19:35:12,229 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1968 transitions. Word has length 112 [2025-03-16 19:35:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,229 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1968 transitions. [2025-03-16 19:35:12,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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:35:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1968 transitions. [2025-03-16 19:35:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:35:12,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:12,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 19:35:12,230 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 826339938, now seen corresponding path program 1 times [2025-03-16 19:35:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482948638] [2025-03-16 19:35:12,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:35:12,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:35:12,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,356 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:35:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482948638] [2025-03-16 19:35:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482948638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389310969] [2025-03-16 19:35:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:12,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:12,357 INFO L87 Difference]: Start difference. First operand 1373 states and 1968 transitions. Second operand has 7 states, 7 states have (on average 16.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:35:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,443 INFO L93 Difference]: Finished difference Result 2659 states and 3842 transitions. [2025-03-16 19:35:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:12,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.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:35:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,445 INFO L225 Difference]: With dead ends: 2659 [2025-03-16 19:35:12,445 INFO L226 Difference]: Without dead ends: 1375 [2025-03-16 19:35:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:35:12,447 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 399 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 545 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-16 19:35:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1373. [2025-03-16 19:35:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1372 states have (on average 1.4300291545189505) internal successors, (1962), 1372 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states 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:35:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1962 transitions. [2025-03-16 19:35:12,456 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1962 transitions. Word has length 112 [2025-03-16 19:35:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,456 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1962 transitions. [2025-03-16 19:35:12,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.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:35:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1962 transitions. [2025-03-16 19:35:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:12,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:12,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 19:35:12,457 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,458 INFO L85 PathProgramCache]: Analyzing trace with hash -160142935, now seen corresponding path program 1 times [2025-03-16 19:35:12,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794746747] [2025-03-16 19:35:12,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:12,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:12,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,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:35:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794746747] [2025-03-16 19:35:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794746747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336132640] [2025-03-16 19:35:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,518 INFO L87 Difference]: Start difference. First operand 1373 states and 1962 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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:35:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,532 INFO L93 Difference]: Finished difference Result 3853 states and 5542 transitions. [2025-03-16 19:35:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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:35:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,536 INFO L225 Difference]: With dead ends: 3853 [2025-03-16 19:35:12,536 INFO L226 Difference]: Without dead ends: 2569 [2025-03-16 19:35:12,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,537 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 89 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-03-16 19:35:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2479. [2025-03-16 19:35:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 1.4293785310734464) internal successors, (3542), 2478 states have internal predecessors, (3542), 0 states have call successors, (0), 0 states 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:35:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3542 transitions. [2025-03-16 19:35:12,565 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3542 transitions. Word has length 113 [2025-03-16 19:35:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,565 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3542 transitions. [2025-03-16 19:35:12,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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:35:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3542 transitions. [2025-03-16 19:35:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:35:12,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:12,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 19:35:12,566 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1999243673, now seen corresponding path program 1 times [2025-03-16 19:35:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058574762] [2025-03-16 19:35:12,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:35:12,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:35:12,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:12,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058574762] [2025-03-16 19:35:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058574762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574734586] [2025-03-16 19:35:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:12,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,630 INFO L87 Difference]: Start difference. First operand 2479 states and 3542 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,650 INFO L93 Difference]: Finished difference Result 7083 states and 10128 transitions. [2025-03-16 19:35:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-16 19:35:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,655 INFO L225 Difference]: With dead ends: 7083 [2025-03-16 19:35:12,655 INFO L226 Difference]: Without dead ends: 4693 [2025-03-16 19:35:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,657 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2025-03-16 19:35:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 4515. [2025-03-16 19:35:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4515 states, 4514 states have (on average 1.4213557820115197) internal successors, (6416), 4514 states have internal predecessors, (6416), 0 states have call successors, (0), 0 states 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:35:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4515 states to 4515 states and 6416 transitions. [2025-03-16 19:35:12,688 INFO L78 Accepts]: Start accepts. Automaton has 4515 states and 6416 transitions. Word has length 114 [2025-03-16 19:35:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,688 INFO L471 AbstractCegarLoop]: Abstraction has 4515 states and 6416 transitions. [2025-03-16 19:35:12,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4515 states and 6416 transitions. [2025-03-16 19:35:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:35:12,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,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, 1, 1] [2025-03-16 19:35:12,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 19:35:12,689 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2118881269, now seen corresponding path program 1 times [2025-03-16 19:35:12,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104895356] [2025-03-16 19:35:12,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:35:12,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:35:12,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,752 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:35:12,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104895356] [2025-03-16 19:35:12,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104895356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125431633] [2025-03-16 19:35:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:12,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,753 INFO L87 Difference]: Start difference. First operand 4515 states and 6416 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,779 INFO L93 Difference]: Finished difference Result 13015 states and 18442 transitions. [2025-03-16 19:35:12,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:12,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 19:35:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:12,791 INFO L225 Difference]: With dead ends: 13015 [2025-03-16 19:35:12,791 INFO L226 Difference]: Without dead ends: 8589 [2025-03-16 19:35:12,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,796 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 75 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:12,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 404 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8589 states. [2025-03-16 19:35:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8589 to 8235. [2025-03-16 19:35:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8235 states, 8234 states have (on average 1.4078212290502794) internal successors, (11592), 8234 states have internal predecessors, (11592), 0 states have call successors, (0), 0 states 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:35:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8235 states to 8235 states and 11592 transitions. [2025-03-16 19:35:12,866 INFO L78 Accepts]: Start accepts. Automaton has 8235 states and 11592 transitions. Word has length 115 [2025-03-16 19:35:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 8235 states and 11592 transitions. [2025-03-16 19:35:12,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 8235 states and 11592 transitions. [2025-03-16 19:35:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:35:12,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:12,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:12,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 19:35:12,867 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:12,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash -940319565, now seen corresponding path program 1 times [2025-03-16 19:35:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760073955] [2025-03-16 19:35:12,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:12,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:12,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:35:12,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:35:12,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:12,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:12,952 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:35:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760073955] [2025-03-16 19:35:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760073955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:12,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072989797] [2025-03-16 19:35:12,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:12,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:12,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:12,953 INFO L87 Difference]: Start difference. First operand 8235 states and 11592 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:12,994 INFO L93 Difference]: Finished difference Result 23823 states and 33354 transitions. [2025-03-16 19:35:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2025-03-16 19:35:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:13,016 INFO L225 Difference]: With dead ends: 23823 [2025-03-16 19:35:13,016 INFO L226 Difference]: Without dead ends: 15677 [2025-03-16 19:35:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:13,025 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 65 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 404 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15677 states. [2025-03-16 19:35:13,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15677 to 14971. [2025-03-16 19:35:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14971 states, 14970 states have (on average 1.389445557782231) internal successors, (20800), 14970 states have internal predecessors, (20800), 0 states have call successors, (0), 0 states 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:35:13,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14971 states to 14971 states and 20800 transitions. [2025-03-16 19:35:13,154 INFO L78 Accepts]: Start accepts. Automaton has 14971 states and 20800 transitions. Word has length 116 [2025-03-16 19:35:13,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:13,154 INFO L471 AbstractCegarLoop]: Abstraction has 14971 states and 20800 transitions. [2025-03-16 19:35:13,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14971 states and 20800 transitions. [2025-03-16 19:35:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:35:13,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:13,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:13,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 19:35:13,155 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2094384990, now seen corresponding path program 1 times [2025-03-16 19:35:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971234822] [2025-03-16 19:35:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:13,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:35:13,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:35:13,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:13,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:13,344 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:35:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971234822] [2025-03-16 19:35:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971234822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:35:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756832355] [2025-03-16 19:35:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:35:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:13,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:35:13,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:35:13,347 INFO L87 Difference]: Start difference. First operand 14971 states and 20800 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:13,385 INFO L93 Difference]: Finished difference Result 15453 states and 21441 transitions. [2025-03-16 19:35:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:35:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-16 19:35:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:13,409 INFO L225 Difference]: With dead ends: 15453 [2025-03-16 19:35:13,409 INFO L226 Difference]: Without dead ends: 15451 [2025-03-16 19:35:13,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:35:13,415 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:13,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 919 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15451 states. [2025-03-16 19:35:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15451 to 15451. [2025-03-16 19:35:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15451 states, 15450 states have (on average 1.3711326860841424) internal successors, (21184), 15450 states have internal predecessors, (21184), 0 states have call successors, (0), 0 states 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:35:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15451 states to 15451 states and 21184 transitions. [2025-03-16 19:35:13,551 INFO L78 Accepts]: Start accepts. Automaton has 15451 states and 21184 transitions. Word has length 117 [2025-03-16 19:35:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:13,552 INFO L471 AbstractCegarLoop]: Abstraction has 15451 states and 21184 transitions. [2025-03-16 19:35:13,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 15451 states and 21184 transitions. [2025-03-16 19:35:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:35:13,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:13,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 19:35:13,553 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:13,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash 275787753, now seen corresponding path program 1 times [2025-03-16 19:35:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061025720] [2025-03-16 19:35:13,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:13,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:35:13,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:35:13,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:13,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:13,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:13,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061025720] [2025-03-16 19:35:13,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061025720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:13,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:13,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150096728] [2025-03-16 19:35:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:13,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:13,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:13,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:13,642 INFO L87 Difference]: Start difference. First operand 15451 states and 21184 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:13,801 INFO L93 Difference]: Finished difference Result 29463 states and 40550 transitions. [2025-03-16 19:35:13,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:13,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2025-03-16 19:35:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:13,832 INFO L225 Difference]: With dead ends: 29463 [2025-03-16 19:35:13,832 INFO L226 Difference]: Without dead ends: 26661 [2025-03-16 19:35:13,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:13,839 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 971 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:13,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1291 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26661 states. [2025-03-16 19:35:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26661 to 18251. [2025-03-16 19:35:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18251 states, 18250 states have (on average 1.3711780821917807) internal successors, (25024), 18250 states have internal predecessors, (25024), 0 states have call successors, (0), 0 states 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:35:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18251 states to 18251 states and 25024 transitions. [2025-03-16 19:35:14,025 INFO L78 Accepts]: Start accepts. Automaton has 18251 states and 25024 transitions. Word has length 117 [2025-03-16 19:35:14,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:14,026 INFO L471 AbstractCegarLoop]: Abstraction has 18251 states and 25024 transitions. [2025-03-16 19:35:14,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:14,026 INFO L276 IsEmpty]: Start isEmpty. Operand 18251 states and 25024 transitions. [2025-03-16 19:35:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:35:14,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:14,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 19:35:14,026 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:14,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:14,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1550835354, now seen corresponding path program 1 times [2025-03-16 19:35:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290368395] [2025-03-16 19:35:14,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:14,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:35:14,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:35:14,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:14,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:14,096 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:35:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290368395] [2025-03-16 19:35:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290368395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795429044] [2025-03-16 19:35:14,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:14,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:14,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:14,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:14,098 INFO L87 Difference]: Start difference. First operand 18251 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:14,213 INFO L93 Difference]: Finished difference Result 47295 states and 64674 transitions. [2025-03-16 19:35:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-03-16 19:35:14,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:14,244 INFO L225 Difference]: With dead ends: 47295 [2025-03-16 19:35:14,244 INFO L226 Difference]: Without dead ends: 29133 [2025-03-16 19:35:14,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:14,257 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:14,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 407 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29133 states. [2025-03-16 19:35:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29133 to 27467. [2025-03-16 19:35:14,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27467 states, 27466 states have (on average 1.3561494211024538) internal successors, (37248), 27466 states have internal predecessors, (37248), 0 states have call successors, (0), 0 states 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:35:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27467 states to 27467 states and 37248 transitions. [2025-03-16 19:35:14,587 INFO L78 Accepts]: Start accepts. Automaton has 27467 states and 37248 transitions. Word has length 118 [2025-03-16 19:35:14,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:14,587 INFO L471 AbstractCegarLoop]: Abstraction has 27467 states and 37248 transitions. [2025-03-16 19:35:14,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27467 states and 37248 transitions. [2025-03-16 19:35:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:35:14,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:14,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:14,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 19:35:14,591 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:14,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:14,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1725812736, now seen corresponding path program 1 times [2025-03-16 19:35:14,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:14,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170240605] [2025-03-16 19:35:14,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:14,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:14,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:35:14,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:35:14,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:14,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:14,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170240605] [2025-03-16 19:35:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170240605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:14,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725756391] [2025-03-16 19:35:14,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:14,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:14,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:14,690 INFO L87 Difference]: Start difference. First operand 27467 states and 37248 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:35:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:14,812 INFO L93 Difference]: Finished difference Result 54847 states and 74402 transitions. [2025-03-16 19:35:14,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:14,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 19:35:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:14,842 INFO L225 Difference]: With dead ends: 54847 [2025-03-16 19:35:14,843 INFO L226 Difference]: Without dead ends: 27469 [2025-03-16 19:35:14,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:14,867 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:14,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 378 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:14,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27469 states. [2025-03-16 19:35:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27469 to 27467. [2025-03-16 19:35:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27467 states, 27466 states have (on average 1.3410034224131653) internal successors, (36832), 27466 states have internal predecessors, (36832), 0 states have call successors, (0), 0 states 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:35:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27467 states to 27467 states and 36832 transitions. [2025-03-16 19:35:15,168 INFO L78 Accepts]: Start accepts. Automaton has 27467 states and 36832 transitions. Word has length 148 [2025-03-16 19:35:15,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:15,168 INFO L471 AbstractCegarLoop]: Abstraction has 27467 states and 36832 transitions. [2025-03-16 19:35:15,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states 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:35:15,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27467 states and 36832 transitions. [2025-03-16 19:35:15,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-16 19:35:15,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:15,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:15,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 19:35:15,171 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:15,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:15,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1842685457, now seen corresponding path program 1 times [2025-03-16 19:35:15,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:15,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405102723] [2025-03-16 19:35:15,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:15,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:35:15,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:35:15,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:15,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405102723] [2025-03-16 19:35:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405102723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:35:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427397110] [2025-03-16 19:35:15,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:15,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:15,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:15,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:35:15,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:35:15,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-16 19:35:15,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-16 19:35:15,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:15,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:15,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:35:15,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:35:16,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:16,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:35:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427397110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:35:17,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:35:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-03-16 19:35:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571052176] [2025-03-16 19:35:17,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:35:17,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:35:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:17,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:35:17,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:35:17,800 INFO L87 Difference]: Start difference. First operand 27467 states and 36832 transitions. Second operand has 31 states, 31 states have (on average 12.96774193548387) internal successors, (402), 30 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:35:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:25,193 INFO L93 Difference]: Finished difference Result 231574 states and 308489 transitions. [2025-03-16 19:35:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-16 19:35:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 12.96774193548387) internal successors, (402), 30 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2025-03-16 19:35:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:25,452 INFO L225 Difference]: With dead ends: 231574 [2025-03-16 19:35:25,452 INFO L226 Difference]: Without dead ends: 204196 [2025-03-16 19:35:25,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10521 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4722, Invalid=27140, Unknown=0, NotChecked=0, Total=31862 [2025-03-16 19:35:25,510 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 7120 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 4281 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7120 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 4281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:25,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7120 Valid, 3296 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 4281 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:35:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204196 states. [2025-03-16 19:35:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204196 to 136996. [2025-03-16 19:35:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136996 states, 136995 states have (on average 1.3307055002007373) internal successors, (182300), 136995 states have internal predecessors, (182300), 0 states have call successors, (0), 0 states 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:35:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136996 states to 136996 states and 182300 transitions. [2025-03-16 19:35:27,047 INFO L78 Accepts]: Start accepts. Automaton has 136996 states and 182300 transitions. Word has length 148 [2025-03-16 19:35:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:27,047 INFO L471 AbstractCegarLoop]: Abstraction has 136996 states and 182300 transitions. [2025-03-16 19:35:27,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 12.96774193548387) internal successors, (402), 30 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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:35:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 136996 states and 182300 transitions. [2025-03-16 19:35:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 19:35:27,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:27,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:27,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:35:27,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-16 19:35:27,257 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash 120694810, now seen corresponding path program 1 times [2025-03-16 19:35:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352599525] [2025-03-16 19:35:27,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:35:27,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:35:27,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:27,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:27,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352599525] [2025-03-16 19:35:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352599525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:35:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651749124] [2025-03-16 19:35:27,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:27,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:27,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:35:27,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:35:28,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:35:28,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:35:28,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:28,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:28,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:35:28,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:35:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:28,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:35:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651749124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:35:29,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:35:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2025-03-16 19:35:29,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240112933] [2025-03-16 19:35:29,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:35:29,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 19:35:29,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:29,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 19:35:29,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:35:29,073 INFO L87 Difference]: Start difference. First operand 136996 states and 182300 transitions. Second operand has 26 states, 26 states have (on average 15.23076923076923) internal successors, (396), 26 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:35:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:32,512 INFO L93 Difference]: Finished difference Result 597706 states and 795497 transitions. [2025-03-16 19:35:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-16 19:35:32,513 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 15.23076923076923) internal successors, (396), 26 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-16 19:35:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:33,623 INFO L225 Difference]: With dead ends: 597706 [2025-03-16 19:35:33,623 INFO L226 Difference]: Without dead ends: 460868 [2025-03-16 19:35:33,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2636 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1349, Invalid=8353, Unknown=0, NotChecked=0, Total=9702 [2025-03-16 19:35:33,690 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 3506 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3506 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:33,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3506 Valid, 3516 Invalid, 3110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 19:35:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460868 states. [2025-03-16 19:35:37,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460868 to 316971. [2025-03-16 19:35:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316971 states, 316970 states have (on average 1.3293466258636464) internal successors, (421363), 316970 states have internal predecessors, (421363), 0 states have call successors, (0), 0 states 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:35:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316971 states to 316971 states and 421363 transitions. [2025-03-16 19:35:38,431 INFO L78 Accepts]: Start accepts. Automaton has 316971 states and 421363 transitions. Word has length 149 [2025-03-16 19:35:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 316971 states and 421363 transitions. [2025-03-16 19:35:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 15.23076923076923) internal successors, (396), 26 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:35:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 316971 states and 421363 transitions. [2025-03-16 19:35:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:35:38,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:38,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:39,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:35:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-03-16 19:35:39,199 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1724779731, now seen corresponding path program 1 times [2025-03-16 19:35:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379337537] [2025-03-16 19:35:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:39,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:35:39,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:35:39,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:39,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:35:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379337537] [2025-03-16 19:35:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379337537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806888521] [2025-03-16 19:35:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:39,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:39,271 INFO L87 Difference]: Start difference. First operand 316971 states and 421363 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:35:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:40,893 INFO L93 Difference]: Finished difference Result 532359 states and 709285 transitions. [2025-03-16 19:35:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2025-03-16 19:35:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:41,212 INFO L225 Difference]: With dead ends: 532359 [2025-03-16 19:35:41,212 INFO L226 Difference]: Without dead ends: 215560 [2025-03-16 19:35:41,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:41,286 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 123 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:41,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 158 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215560 states. [2025-03-16 19:35:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215560 to 215501. [2025-03-16 19:35:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215501 states, 215500 states have (on average 1.3257494199535962) internal successors, (285699), 215500 states have internal predecessors, (285699), 0 states have call successors, (0), 0 states 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:35:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215501 states to 215501 states and 285699 transitions. [2025-03-16 19:35:43,993 INFO L78 Accepts]: Start accepts. Automaton has 215501 states and 285699 transitions. Word has length 150 [2025-03-16 19:35:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:43,993 INFO L471 AbstractCegarLoop]: Abstraction has 215501 states and 285699 transitions. [2025-03-16 19:35:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:35:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 215501 states and 285699 transitions. [2025-03-16 19:35:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:35:44,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:44,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:44,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-16 19:35:44,006 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:44,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1795363880, now seen corresponding path program 1 times [2025-03-16 19:35:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:44,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044232863] [2025-03-16 19:35:44,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:44,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:35:44,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:35:44,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:44,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat