./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:49:06,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:49:06,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:49:06,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:49:06,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:49:06,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:49:06,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:49:06,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:49:06,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:49:06,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:49:06,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:49:06,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:49:06,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:49:06,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:49:06,281 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:49:06,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:49:06,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:49:06,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:49:06,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:49:06,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:49:06,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:49:06,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:49:06,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:49:06,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:49:06,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:49:06,285 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 38533fb2932c589b42c93c264dc8e5e297bb0dbb9a49080a666466aefcec5174 [2025-01-09 04:49:06,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:49:06,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:49:06,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:49:06,519 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:49:06,519 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:49:06,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:49:07,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b933a7f3/a30a542fa15142219060fd0f949ce5a0/FLAGe889bb193 [2025-01-09 04:49:07,929 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:49:07,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:49:07,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b933a7f3/a30a542fa15142219060fd0f949ce5a0/FLAGe889bb193 [2025-01-09 04:49:08,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b933a7f3/a30a542fa15142219060fd0f949ce5a0 [2025-01-09 04:49:08,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:49:08,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:49:08,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:49:08,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:49:08,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:49:08,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17654bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08, skipping insertion in model container [2025-01-09 04:49:08,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,237 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:49:08,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2025-01-09 04:49:08,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2025-01-09 04:49:08,437 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2025-01-09 04:49:08,440 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2025-01-09 04:49:08,447 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2025-01-09 04:49:08,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2025-01-09 04:49:08,459 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2025-01-09 04:49:08,466 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2025-01-09 04:49:08,468 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2025-01-09 04:49:08,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2025-01-09 04:49:08,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2025-01-09 04:49:08,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:49:08,544 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:49:08,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9419,9432] [2025-01-09 04:49:08,607 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12891,12904] [2025-01-09 04:49:08,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14047,14060] [2025-01-09 04:49:08,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14703,14716] [2025-01-09 04:49:08,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16224,16237] [2025-01-09 04:49:08,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16880,16893] [2025-01-09 04:49:08,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17864,17877] [2025-01-09 04:49:08,628 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20202,20215] [2025-01-09 04:49:08,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20861,20874] [2025-01-09 04:49:08,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21885,21898] [2025-01-09 04:49:08,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23760,23773] [2025-01-09 04:49:08,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:49:08,694 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:49:08,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08 WrapperNode [2025-01-09 04:49:08,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:49:08,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:49:08,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:49:08,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:49:08,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,755 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2020 [2025-01-09 04:49:08,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:49:08,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:49:08,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:49:08,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:49:08,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,795 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-01-09 04:49:08,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,840 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:49:08,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:49:08,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:49:08,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:49:08,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (1/1) ... [2025-01-09 04:49:08,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:49:08,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:08,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:49:08,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:49:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:49:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:49:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:49:08,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:49:09,029 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:49:09,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:49:09,895 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2025-01-09 04:49:09,896 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:49:09,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:49:09,908 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:49:09,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:09 BoogieIcfgContainer [2025-01-09 04:49:09,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:49:09,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:49:09,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:49:09,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:49:09,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:49:08" (1/3) ... [2025-01-09 04:49:09,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304bdd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:09, skipping insertion in model container [2025-01-09 04:49:09,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:49:08" (2/3) ... [2025-01-09 04:49:09,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304bdd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:49:09, skipping insertion in model container [2025-01-09 04:49:09,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:49:09" (3/3) ... [2025-01-09 04:49:09,916 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-01-09 04:49:09,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:49:09,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 358 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-01-09 04:49:09,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:49:09,980 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;@2fab0abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:49:09,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 04:49:09,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:09,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 04:49:09,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:09,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:09,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:09,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1374718599, now seen corresponding path program 1 times [2025-01-09 04:49:10,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:10,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148745816] [2025-01-09 04:49:10,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 04:49:10,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 04:49:10,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:10,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148745816] [2025-01-09 04:49:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148745816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:10,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:49:10,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617304054] [2025-01-09 04:49:10,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:10,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:49:10,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:10,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:49:10,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:49:10,472 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 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 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:10,751 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2025-01-09 04:49:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:49:10,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 04:49:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:10,763 INFO L225 Difference]: With dead ends: 570 [2025-01-09 04:49:10,763 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 04:49:10,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:49:10,767 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1459 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:10,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 363 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 04:49:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-01-09 04:49:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 293 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2025-01-09 04:49:10,798 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 59 [2025-01-09 04:49:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:10,799 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2025-01-09 04:49:10,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2025-01-09 04:49:10,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 04:49:10,803 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:10,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:10,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:49:10,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:10,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2133391140, now seen corresponding path program 1 times [2025-01-09 04:49:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:10,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657713699] [2025-01-09 04:49:10,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:10,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 04:49:10,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 04:49:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:10,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:10,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657713699] [2025-01-09 04:49:10,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657713699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:10,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:49:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892330953] [2025-01-09 04:49:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:49:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:10,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:49:10,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:49:10,983 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:11,174 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2025-01-09 04:49:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:49:11,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 04:49:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:11,176 INFO L225 Difference]: With dead ends: 497 [2025-01-09 04:49:11,176 INFO L226 Difference]: Without dead ends: 274 [2025-01-09 04:49:11,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:49:11,177 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 950 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:11,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 210 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:11,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-01-09 04:49:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-01-09 04:49:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 263 states have (on average 1.3003802281368821) internal successors, (342), 273 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2025-01-09 04:49:11,191 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 60 [2025-01-09 04:49:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:11,191 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2025-01-09 04:49:11,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2025-01-09 04:49:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 04:49:11,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:11,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:11,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:49:11,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 626465560, now seen corresponding path program 1 times [2025-01-09 04:49:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:11,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416954644] [2025-01-09 04:49:11,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:11,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:11,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 04:49:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 04:49:11,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:11,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416954644] [2025-01-09 04:49:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416954644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:49:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523089868] [2025-01-09 04:49:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:11,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:49:11,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:11,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:49:11,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:49:11,324 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:11,466 INFO L93 Difference]: Finished difference Result 477 states and 610 transitions. [2025-01-09 04:49:11,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:49:11,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-01-09 04:49:11,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:11,468 INFO L225 Difference]: With dead ends: 477 [2025-01-09 04:49:11,468 INFO L226 Difference]: Without dead ends: 255 [2025-01-09 04:49:11,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:49:11,469 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:11,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 199 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-01-09 04:49:11,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-01-09 04:49:11,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 254 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2025-01-09 04:49:11,474 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 61 [2025-01-09 04:49:11,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:11,475 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2025-01-09 04:49:11,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,475 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2025-01-09 04:49:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 04:49:11,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:11,476 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:11,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:49:11,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:11,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash 55190193, now seen corresponding path program 1 times [2025-01-09 04:49:11,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:11,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539821300] [2025-01-09 04:49:11,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:11,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:11,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 04:49:11,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 04:49:11,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:11,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:11,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:11,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539821300] [2025-01-09 04:49:11,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539821300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:11,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:11,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:49:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60845346] [2025-01-09 04:49:11,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:11,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:49:11,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:11,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:49:11,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:49:11,574 INFO L87 Difference]: Start difference. First operand 255 states and 320 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:11,708 INFO L93 Difference]: Finished difference Result 458 states and 587 transitions. [2025-01-09 04:49:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:49:11,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-01-09 04:49:11,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:11,709 INFO L225 Difference]: With dead ends: 458 [2025-01-09 04:49:11,709 INFO L226 Difference]: Without dead ends: 247 [2025-01-09 04:49:11,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:49:11,710 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 867 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:11,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 195 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-01-09 04:49:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-01-09 04:49:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 246 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2025-01-09 04:49:11,714 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 62 [2025-01-09 04:49:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2025-01-09 04:49:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2025-01-09 04:49:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:49:11,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:11,715 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:11,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:49:11,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1176799625, now seen corresponding path program 1 times [2025-01-09 04:49:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997993701] [2025-01-09 04:49:11,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:11,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:49:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:49:11,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:11,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:12,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997993701] [2025-01-09 04:49:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997993701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:12,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:12,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:12,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267051261] [2025-01-09 04:49:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:12,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:12,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:12,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:12,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:12,055 INFO L87 Difference]: Start difference. First operand 247 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:12,532 INFO L93 Difference]: Finished difference Result 471 states and 608 transitions. [2025-01-09 04:49:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:12,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:49:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:12,534 INFO L225 Difference]: With dead ends: 471 [2025-01-09 04:49:12,534 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 04:49:12,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:49:12,534 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1424 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:12,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 993 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:49:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 04:49:12,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 247. [2025-01-09 04:49:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3093220338983051) internal successors, (309), 246 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:12,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2025-01-09 04:49:12,545 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 63 [2025-01-09 04:49:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2025-01-09 04:49:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2025-01-09 04:49:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:49:12,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:12,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] [2025-01-09 04:49:12,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:49:12,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:12,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1585644853, now seen corresponding path program 1 times [2025-01-09 04:49:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:12,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840247858] [2025-01-09 04:49:12,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:49:12,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:49:12,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:12,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:12,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840247858] [2025-01-09 04:49:12,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840247858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:12,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889960059] [2025-01-09 04:49:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:12,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:12,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:12,822 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:13,210 INFO L93 Difference]: Finished difference Result 376 states and 469 transitions. [2025-01-09 04:49:13,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:49:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:13,212 INFO L225 Difference]: With dead ends: 376 [2025-01-09 04:49:13,213 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 04:49:13,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:13,214 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 820 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:13,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 742 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 04:49:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2025-01-09 04:49:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.305084745762712) internal successors, (308), 246 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2025-01-09 04:49:13,222 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 308 transitions. Word has length 63 [2025-01-09 04:49:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:13,223 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 308 transitions. [2025-01-09 04:49:13,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 308 transitions. [2025-01-09 04:49:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 04:49:13,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:13,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:49:13,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:13,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 202563885, now seen corresponding path program 1 times [2025-01-09 04:49:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653430009] [2025-01-09 04:49:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 04:49:13,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 04:49:13,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:13,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653430009] [2025-01-09 04:49:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653430009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:49:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024379349] [2025-01-09 04:49:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:49:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:49:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:49:13,460 INFO L87 Difference]: Start difference. First operand 247 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:13,777 INFO L93 Difference]: Finished difference Result 486 states and 608 transitions. [2025-01-09 04:49:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:49:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 04:49:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:13,779 INFO L225 Difference]: With dead ends: 486 [2025-01-09 04:49:13,779 INFO L226 Difference]: Without dead ends: 353 [2025-01-09 04:49:13,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-01-09 04:49:13,780 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1270 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:13,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 767 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-01-09 04:49:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2025-01-09 04:49:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.3008474576271187) internal successors, (307), 246 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2025-01-09 04:49:13,784 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 63 [2025-01-09 04:49:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:13,784 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2025-01-09 04:49:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2025-01-09 04:49:13,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:13,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:13,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:13,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:49:13,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:13,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:13,786 INFO L85 PathProgramCache]: Analyzing trace with hash -620136770, now seen corresponding path program 1 times [2025-01-09 04:49:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:13,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379095091] [2025-01-09 04:49:13,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:13,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:13,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:13,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:13,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379095091] [2025-01-09 04:49:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379095091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197844726] [2025-01-09 04:49:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:14,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:14,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:14,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:14,024 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:14,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:14,388 INFO L93 Difference]: Finished difference Result 430 states and 546 transitions. [2025-01-09 04:49:14,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:14,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:14,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:14,390 INFO L225 Difference]: With dead ends: 430 [2025-01-09 04:49:14,390 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 04:49:14,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:14,391 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1710 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1710 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:14,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1710 Valid, 745 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 04:49:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2025-01-09 04:49:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2966101694915255) internal successors, (306), 246 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2025-01-09 04:49:14,395 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 65 [2025-01-09 04:49:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:14,395 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2025-01-09 04:49:14,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2025-01-09 04:49:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:14,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:14,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:14,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:49:14,396 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:14,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1292060332, now seen corresponding path program 1 times [2025-01-09 04:49:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487274089] [2025-01-09 04:49:14,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:14,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:14,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:14,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487274089] [2025-01-09 04:49:14,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487274089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:14,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:14,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:49:14,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918876581] [2025-01-09 04:49:14,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:14,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:14,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:14,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:14,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:14,783 INFO L87 Difference]: Start difference. First operand 247 states and 306 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:15,527 INFO L93 Difference]: Finished difference Result 632 states and 839 transitions. [2025-01-09 04:49:15,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:49:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:15,529 INFO L225 Difference]: With dead ends: 632 [2025-01-09 04:49:15,530 INFO L226 Difference]: Without dead ends: 561 [2025-01-09 04:49:15,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:49:15,530 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 3487 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3487 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:15,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3487 Valid, 1118 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:49:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-01-09 04:49:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 251. [2025-01-09 04:49:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2916666666666667) internal successors, (310), 250 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 310 transitions. [2025-01-09 04:49:15,537 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 310 transitions. Word has length 65 [2025-01-09 04:49:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:15,537 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 310 transitions. [2025-01-09 04:49:15,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 310 transitions. [2025-01-09 04:49:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:15,537 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:15,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:15,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:49:15,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1564639340, now seen corresponding path program 1 times [2025-01-09 04:49:15,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:15,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891164333] [2025-01-09 04:49:15,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:15,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:15,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:15,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:15,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:15,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:15,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-01-09 04:49:15,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:15,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891164333] [2025-01-09 04:49:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891164333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:15,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:15,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901384730] [2025-01-09 04:49:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:15,754 INFO L87 Difference]: Start difference. First operand 251 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:16,134 INFO L93 Difference]: Finished difference Result 445 states and 568 transitions. [2025-01-09 04:49:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:16,137 INFO L225 Difference]: With dead ends: 445 [2025-01-09 04:49:16,137 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 04:49:16,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:16,138 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1673 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:16,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 824 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 04:49:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 251. [2025-01-09 04:49:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2875) internal successors, (309), 250 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 309 transitions. [2025-01-09 04:49:16,142 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 309 transitions. Word has length 65 [2025-01-09 04:49:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 309 transitions. [2025-01-09 04:49:16,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 309 transitions. [2025-01-09 04:49:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:16,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:16,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:49:16,146 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:16,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash -109241464, now seen corresponding path program 1 times [2025-01-09 04:49:16,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:16,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142731867] [2025-01-09 04:49:16,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:16,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:16,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:16,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:16,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:16,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142731867] [2025-01-09 04:49:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142731867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752383013] [2025-01-09 04:49:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:16,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:16,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:16,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:16,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:16,348 INFO L87 Difference]: Start difference. First operand 251 states and 309 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:16,712 INFO L93 Difference]: Finished difference Result 431 states and 545 transitions. [2025-01-09 04:49:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:16,713 INFO L225 Difference]: With dead ends: 431 [2025-01-09 04:49:16,714 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 04:49:16,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:16,714 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1662 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:16,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 777 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 04:49:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 251. [2025-01-09 04:49:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2833333333333334) internal successors, (308), 250 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 308 transitions. [2025-01-09 04:49:16,719 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 308 transitions. Word has length 65 [2025-01-09 04:49:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:16,719 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 308 transitions. [2025-01-09 04:49:16,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 308 transitions. [2025-01-09 04:49:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:16,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:16,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:49:16,721 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -636059456, now seen corresponding path program 1 times [2025-01-09 04:49:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012952291] [2025-01-09 04:49:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:16,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:16,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:16,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:16,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:16,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:16,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012952291] [2025-01-09 04:49:16,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012952291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:16,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:16,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559432563] [2025-01-09 04:49:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:16,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:16,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:16,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:16,910 INFO L87 Difference]: Start difference. First operand 251 states and 308 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:17,355 INFO L93 Difference]: Finished difference Result 481 states and 611 transitions. [2025-01-09 04:49:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:17,355 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:17,356 INFO L225 Difference]: With dead ends: 481 [2025-01-09 04:49:17,356 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 04:49:17,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:17,357 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1004 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:17,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1214 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 04:49:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 251. [2025-01-09 04:49:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2791666666666666) internal successors, (307), 250 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 307 transitions. [2025-01-09 04:49:17,362 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 307 transitions. Word has length 65 [2025-01-09 04:49:17,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:17,362 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 307 transitions. [2025-01-09 04:49:17,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,362 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 307 transitions. [2025-01-09 04:49:17,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:17,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:17,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:17,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:49:17,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:17,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2058271748, now seen corresponding path program 1 times [2025-01-09 04:49:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874944999] [2025-01-09 04:49:17,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:17,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:17,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:17,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:17,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874944999] [2025-01-09 04:49:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874944999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:17,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375814783] [2025-01-09 04:49:17,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:17,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:17,533 INFO L87 Difference]: Start difference. First operand 251 states and 307 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:17,911 INFO L93 Difference]: Finished difference Result 380 states and 466 transitions. [2025-01-09 04:49:17,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:17,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:17,912 INFO L225 Difference]: With dead ends: 380 [2025-01-09 04:49:17,912 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 04:49:17,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:17,913 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1652 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1652 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:17,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1652 Valid, 777 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 04:49:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 251. [2025-01-09 04:49:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.275) internal successors, (306), 250 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2025-01-09 04:49:17,917 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 65 [2025-01-09 04:49:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:17,917 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2025-01-09 04:49:17,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2025-01-09 04:49:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 04:49:17,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:17,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:17,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:49:17,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:17,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -324498446, now seen corresponding path program 1 times [2025-01-09 04:49:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748672655] [2025-01-09 04:49:17,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:17,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 04:49:17,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 04:49:17,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:17,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:18,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-01-09 04:49:18,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748672655] [2025-01-09 04:49:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748672655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40999503] [2025-01-09 04:49:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:18,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:18,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:18,096 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:18,440 INFO L93 Difference]: Finished difference Result 396 states and 490 transitions. [2025-01-09 04:49:18,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 04:49:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:18,442 INFO L225 Difference]: With dead ends: 396 [2025-01-09 04:49:18,442 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 04:49:18,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:49:18,443 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1282 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:18,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 970 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 04:49:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 251. [2025-01-09 04:49:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 240 states have (on average 1.2708333333333333) internal successors, (305), 250 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2025-01-09 04:49:18,447 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 65 [2025-01-09 04:49:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:18,447 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2025-01-09 04:49:18,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2025-01-09 04:49:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:49:18,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:18,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:49:18,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:18,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:18,448 INFO L85 PathProgramCache]: Analyzing trace with hash -849466761, now seen corresponding path program 1 times [2025-01-09 04:49:18,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919835114] [2025-01-09 04:49:18,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:18,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:18,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:49:18,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:49:18,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:18,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:18,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-01-09 04:49:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919835114] [2025-01-09 04:49:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919835114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:18,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:18,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325284313] [2025-01-09 04:49:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:18,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:18,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:18,608 INFO L87 Difference]: Start difference. First operand 251 states and 305 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:19,089 INFO L93 Difference]: Finished difference Result 450 states and 569 transitions. [2025-01-09 04:49:19,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 04:49:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:19,091 INFO L225 Difference]: With dead ends: 450 [2025-01-09 04:49:19,091 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 04:49:19,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:49:19,093 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 944 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:19,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1119 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:49:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 04:49:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 247. [2025-01-09 04:49:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.271186440677966) internal successors, (300), 246 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2025-01-09 04:49:19,097 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 66 [2025-01-09 04:49:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2025-01-09 04:49:19,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2025-01-09 04:49:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:19,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:19,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:19,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:49:19,098 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:19,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -809481061, now seen corresponding path program 1 times [2025-01-09 04:49:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:19,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620983284] [2025-01-09 04:49:19,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:19,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:19,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:19,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:19,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:19,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:19,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620983284] [2025-01-09 04:49:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620983284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:19,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 04:49:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30410409] [2025-01-09 04:49:19,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:19,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 04:49:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:19,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 04:49:19,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:49:19,896 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:21,750 INFO L93 Difference]: Finished difference Result 689 states and 865 transitions. [2025-01-09 04:49:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 04:49:21,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:49:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:21,753 INFO L225 Difference]: With dead ends: 689 [2025-01-09 04:49:21,753 INFO L226 Difference]: Without dead ends: 606 [2025-01-09 04:49:21,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:49:21,754 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2467 mSDsluCounter, 3906 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2467 SdHoareTripleChecker+Valid, 4323 SdHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:21,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2467 Valid, 4323 Invalid, 1968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:49:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-01-09 04:49:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 253. [2025-01-09 04:49:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 242 states have (on average 1.2644628099173554) internal successors, (306), 252 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2025-01-09 04:49:21,759 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 67 [2025-01-09 04:49:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:21,759 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2025-01-09 04:49:21,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2025-01-09 04:49:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:21,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:21,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:21,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:49:21,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1258064571, now seen corresponding path program 1 times [2025-01-09 04:49:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728475451] [2025-01-09 04:49:21,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:21,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:21,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:21,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:21,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:22,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728475451] [2025-01-09 04:49:22,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728475451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:22,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:22,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291785123] [2025-01-09 04:49:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:22,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:22,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:22,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:22,106 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:22,531 INFO L93 Difference]: Finished difference Result 441 states and 557 transitions. [2025-01-09 04:49:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:22,531 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:49:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:22,532 INFO L225 Difference]: With dead ends: 441 [2025-01-09 04:49:22,532 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 04:49:22,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:22,533 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 1280 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:22,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2211 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 04:49:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 229. [2025-01-09 04:49:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 228 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 276 transitions. [2025-01-09 04:49:22,537 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 276 transitions. Word has length 67 [2025-01-09 04:49:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 276 transitions. [2025-01-09 04:49:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 276 transitions. [2025-01-09 04:49:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:22,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:22,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:22,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:49:22,538 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash -827796874, now seen corresponding path program 1 times [2025-01-09 04:49:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:22,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874229418] [2025-01-09 04:49:22,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:22,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:22,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:22,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:22,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:22,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874229418] [2025-01-09 04:49:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874229418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-01-09 04:49:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289377248] [2025-01-09 04:49:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 04:49:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:23,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 04:49:23,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:23,484 INFO L87 Difference]: Start difference. First operand 229 states and 276 transitions. Second operand has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:25,093 INFO L93 Difference]: Finished difference Result 640 states and 807 transitions. [2025-01-09 04:49:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:49:25,093 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:49:25,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:25,095 INFO L225 Difference]: With dead ends: 640 [2025-01-09 04:49:25,095 INFO L226 Difference]: Without dead ends: 582 [2025-01-09 04:49:25,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 04:49:25,096 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2173 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2173 SdHoareTripleChecker+Valid, 4425 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:25,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2173 Valid, 4425 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:49:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-09 04:49:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 244. [2025-01-09 04:49:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 234 states have (on average 1.2692307692307692) internal successors, (297), 243 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 297 transitions. [2025-01-09 04:49:25,100 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 297 transitions. Word has length 67 [2025-01-09 04:49:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:25,100 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 297 transitions. [2025-01-09 04:49:25,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 21 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 297 transitions. [2025-01-09 04:49:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:49:25,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:25,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:25,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:49:25,101 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:25,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 455689729, now seen corresponding path program 1 times [2025-01-09 04:49:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143665122] [2025-01-09 04:49:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:25,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:49:25,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:49:25,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:25,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:25,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143665122] [2025-01-09 04:49:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143665122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:25,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958084344] [2025-01-09 04:49:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:25,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:25,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:25,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:25,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:25,400 INFO L87 Difference]: Start difference. First operand 244 states and 297 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:25,817 INFO L93 Difference]: Finished difference Result 394 states and 505 transitions. [2025-01-09 04:49:25,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:25,817 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 04:49:25,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:25,818 INFO L225 Difference]: With dead ends: 394 [2025-01-09 04:49:25,818 INFO L226 Difference]: Without dead ends: 307 [2025-01-09 04:49:25,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:25,819 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 1107 mSDsluCounter, 1697 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:25,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2005 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-01-09 04:49:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 211. [2025-01-09 04:49:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 204 states have (on average 1.2696078431372548) internal successors, (259), 210 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 259 transitions. [2025-01-09 04:49:25,822 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 259 transitions. Word has length 67 [2025-01-09 04:49:25,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:25,822 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 259 transitions. [2025-01-09 04:49:25,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 259 transitions. [2025-01-09 04:49:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:25,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:25,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] [2025-01-09 04:49:25,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:49:25,822 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:25,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1015007640, now seen corresponding path program 1 times [2025-01-09 04:49:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:25,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127358412] [2025-01-09 04:49:25,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:25,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:25,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127358412] [2025-01-09 04:49:26,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127358412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:26,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711530573] [2025-01-09 04:49:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:26,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:26,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:26,092 INFO L87 Difference]: Start difference. First operand 211 states and 259 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:26,417 INFO L93 Difference]: Finished difference Result 352 states and 454 transitions. [2025-01-09 04:49:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:26,418 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:49:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:26,419 INFO L225 Difference]: With dead ends: 352 [2025-01-09 04:49:26,419 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 04:49:26,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:49:26,420 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 547 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:26,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1171 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:26,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 04:49:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 207. [2025-01-09 04:49:26,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 201 states have (on average 1.263681592039801) internal successors, (254), 206 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 254 transitions. [2025-01-09 04:49:26,423 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 254 transitions. Word has length 68 [2025-01-09 04:49:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:26,423 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 254 transitions. [2025-01-09 04:49:26,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 254 transitions. [2025-01-09 04:49:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:26,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:26,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:26,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:49:26,424 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:26,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:26,424 INFO L85 PathProgramCache]: Analyzing trace with hash 986767498, now seen corresponding path program 1 times [2025-01-09 04:49:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:26,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446480369] [2025-01-09 04:49:26,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:26,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:26,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:26,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446480369] [2025-01-09 04:49:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446480369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286578111] [2025-01-09 04:49:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:26,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:26,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:26,712 INFO L87 Difference]: Start difference. First operand 207 states and 254 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,094 INFO L93 Difference]: Finished difference Result 370 states and 475 transitions. [2025-01-09 04:49:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:49:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,099 INFO L225 Difference]: With dead ends: 370 [2025-01-09 04:49:27,099 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 04:49:27,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:27,100 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 978 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1995 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 04:49:27,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 195. [2025-01-09 04:49:27,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 190 states have (on average 1.2578947368421052) internal successors, (239), 194 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 239 transitions. [2025-01-09 04:49:27,104 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 239 transitions. Word has length 68 [2025-01-09 04:49:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,105 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 239 transitions. [2025-01-09 04:49:27,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 239 transitions. [2025-01-09 04:49:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:27,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:49:27,106 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -922376210, now seen corresponding path program 1 times [2025-01-09 04:49:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079985532] [2025-01-09 04:49:27,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:27,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:27,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079985532] [2025-01-09 04:49:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079985532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259230941] [2025-01-09 04:49:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:27,426 INFO L87 Difference]: Start difference. First operand 195 states and 239 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:27,747 INFO L93 Difference]: Finished difference Result 336 states and 433 transitions. [2025-01-09 04:49:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:49:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:27,748 INFO L225 Difference]: With dead ends: 336 [2025-01-09 04:49:27,748 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 04:49:27,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:49:27,749 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1012 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:27,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 987 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 04:49:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 176. [2025-01-09 04:49:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2383720930232558) internal successors, (213), 175 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 213 transitions. [2025-01-09 04:49:27,752 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 213 transitions. Word has length 68 [2025-01-09 04:49:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 213 transitions. [2025-01-09 04:49:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 213 transitions. [2025-01-09 04:49:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:27,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:27,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:49:27,753 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:27,753 INFO L85 PathProgramCache]: Analyzing trace with hash 823611388, now seen corresponding path program 1 times [2025-01-09 04:49:27,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:27,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511635300] [2025-01-09 04:49:27,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:27,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:27,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:27,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:27,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511635300] [2025-01-09 04:49:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511635300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:27,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:27,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963582856] [2025-01-09 04:49:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:27,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:27,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:27,876 INFO L87 Difference]: Start difference. First operand 176 states and 213 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:28,105 INFO L93 Difference]: Finished difference Result 272 states and 336 transitions. [2025-01-09 04:49:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:49:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:49:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:28,106 INFO L225 Difference]: With dead ends: 272 [2025-01-09 04:49:28,106 INFO L226 Difference]: Without dead ends: 265 [2025-01-09 04:49:28,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:28,107 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 1186 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:28,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 504 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:28,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-01-09 04:49:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 176. [2025-01-09 04:49:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2325581395348837) internal successors, (212), 175 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2025-01-09 04:49:28,109 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 68 [2025-01-09 04:49:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:28,109 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2025-01-09 04:49:28,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,110 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2025-01-09 04:49:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:49:28,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:28,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:28,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:49:28,110 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:28,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash 520441226, now seen corresponding path program 1 times [2025-01-09 04:49:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:28,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213046537] [2025-01-09 04:49:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:28,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:49:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:49:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:28,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:28,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:28,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213046537] [2025-01-09 04:49:28,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213046537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:28,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:28,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:49:28,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748206912] [2025-01-09 04:49:28,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:28,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:28,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:28,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:28,332 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:28,915 INFO L93 Difference]: Finished difference Result 538 states and 714 transitions. [2025-01-09 04:49:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:49:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 04:49:28,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:28,916 INFO L225 Difference]: With dead ends: 538 [2025-01-09 04:49:28,916 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 04:49:28,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-01-09 04:49:28,917 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 2708 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2708 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:28,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2708 Valid, 749 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:49:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 04:49:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 180. [2025-01-09 04:49:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.2272727272727273) internal successors, (216), 179 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-01-09 04:49:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-01-09 04:49:28,923 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 68 [2025-01-09 04:49:28,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:28,923 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-01-09 04:49:28,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-01-09 04:49:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:49:28,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:28,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:28,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:49:28,923 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2115976703, now seen corresponding path program 1 times [2025-01-09 04:49:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518284969] [2025-01-09 04:49:28,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:28,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:28,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:49:28,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:49:28,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:28,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:29,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:29,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518284969] [2025-01-09 04:49:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518284969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137601817] [2025-01-09 04:49:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:29,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:29,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:29,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:29,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:29,139 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:29,571 INFO L93 Difference]: Finished difference Result 276 states and 339 transitions. [2025-01-09 04:49:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:29,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:49:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:29,572 INFO L225 Difference]: With dead ends: 276 [2025-01-09 04:49:29,572 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 04:49:29,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:29,573 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 836 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:29,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 501 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:49:29,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 04:49:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 180. [2025-01-09 04:49:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 176 states have (on average 1.2215909090909092) internal successors, (215), 179 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 215 transitions. [2025-01-09 04:49:29,575 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 215 transitions. Word has length 69 [2025-01-09 04:49:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:29,576 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 215 transitions. [2025-01-09 04:49:29,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 215 transitions. [2025-01-09 04:49:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 04:49:29,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:29,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:29,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:49:29,577 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:29,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:29,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1317093723, now seen corresponding path program 1 times [2025-01-09 04:49:29,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:29,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557018271] [2025-01-09 04:49:29,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:29,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 04:49:29,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 04:49:29,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:29,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:29,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557018271] [2025-01-09 04:49:29,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557018271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:29,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:29,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:49:29,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088185224] [2025-01-09 04:49:29,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:49:29,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:29,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:49:29,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:29,682 INFO L87 Difference]: Start difference. First operand 180 states and 215 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:30,067 INFO L93 Difference]: Finished difference Result 356 states and 447 transitions. [2025-01-09 04:49:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 04:49:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:30,068 INFO L225 Difference]: With dead ends: 356 [2025-01-09 04:49:30,068 INFO L226 Difference]: Without dead ends: 284 [2025-01-09 04:49:30,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:49:30,070 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 797 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:30,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 845 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:49:30,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-01-09 04:49:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 176. [2025-01-09 04:49:30,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 172 states have (on average 1.2209302325581395) internal successors, (210), 175 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2025-01-09 04:49:30,074 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 69 [2025-01-09 04:49:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2025-01-09 04:49:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2025-01-09 04:49:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:49:30,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:30,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] [2025-01-09 04:49:30,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:49:30,075 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:30,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1997555533, now seen corresponding path program 1 times [2025-01-09 04:49:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:30,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742248363] [2025-01-09 04:49:30,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:30,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:49:30,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:49:30,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:30,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742248363] [2025-01-09 04:49:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742248363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:31,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:31,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 04:49:31,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776515521] [2025-01-09 04:49:31,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 04:49:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:31,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 04:49:31,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:49:31,042 INFO L87 Difference]: Start difference. First operand 176 states and 210 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:32,384 INFO L93 Difference]: Finished difference Result 386 states and 485 transitions. [2025-01-09 04:49:32,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 04:49:32,384 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:49:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:32,385 INFO L225 Difference]: With dead ends: 386 [2025-01-09 04:49:32,385 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 04:49:32,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=825, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:49:32,386 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1110 mSDsluCounter, 2533 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:32,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 2792 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 04:49:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 04:49:32,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 193. [2025-01-09 04:49:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 189 states have (on average 1.2222222222222223) internal successors, (231), 192 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 231 transitions. [2025-01-09 04:49:32,392 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 231 transitions. Word has length 70 [2025-01-09 04:49:32,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:32,393 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 231 transitions. [2025-01-09 04:49:32,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 18 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:32,393 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 231 transitions. [2025-01-09 04:49:32,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:49:32,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:32,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:32,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:49:32,393 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:32,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1662348756, now seen corresponding path program 1 times [2025-01-09 04:49:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:32,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317735129] [2025-01-09 04:49:32,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:32,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:49:32,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:49:32,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:32,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317735129] [2025-01-09 04:49:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317735129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-01-09 04:49:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430203873] [2025-01-09 04:49:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:33,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 04:49:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:33,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 04:49:33,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:33,387 INFO L87 Difference]: Start difference. First operand 193 states and 231 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:35,095 INFO L93 Difference]: Finished difference Result 567 states and 714 transitions. [2025-01-09 04:49:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 04:49:35,096 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 04:49:35,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:35,097 INFO L225 Difference]: With dead ends: 567 [2025-01-09 04:49:35,097 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 04:49:35,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 04:49:35,097 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1585 mSDsluCounter, 5449 mSDsCounter, 0 mSdLazyCounter, 2903 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 5905 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:35,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 5905 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2903 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:49:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 04:49:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 202. [2025-01-09 04:49:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.2222222222222223) internal successors, (242), 201 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 242 transitions. [2025-01-09 04:49:35,100 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 242 transitions. Word has length 70 [2025-01-09 04:49:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:35,100 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 242 transitions. [2025-01-09 04:49:35,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:35,100 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 242 transitions. [2025-01-09 04:49:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:49:35,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:35,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:35,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:49:35,101 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:35,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash -944822257, now seen corresponding path program 1 times [2025-01-09 04:49:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694022615] [2025-01-09 04:49:35,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:35,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:49:35,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:49:35,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:35,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:35,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694022615] [2025-01-09 04:49:35,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694022615] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:35,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:35,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:49:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556931874] [2025-01-09 04:49:35,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:35,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:49:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:35,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:49:35,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:49:35,353 INFO L87 Difference]: Start difference. First operand 202 states and 242 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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-01-09 04:49:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:35,666 INFO L93 Difference]: Finished difference Result 426 states and 542 transitions. [2025-01-09 04:49:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:49:35,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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-01-09 04:49:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:35,667 INFO L225 Difference]: With dead ends: 426 [2025-01-09 04:49:35,667 INFO L226 Difference]: Without dead ends: 397 [2025-01-09 04:49:35,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-01-09 04:49:35,668 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1026 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:35,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1196 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-01-09 04:49:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 173. [2025-01-09 04:49:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 170 states have (on average 1.2352941176470589) internal successors, (210), 172 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2025-01-09 04:49:35,671 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 71 [2025-01-09 04:49:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:35,672 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2025-01-09 04:49:35,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 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-01-09 04:49:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2025-01-09 04:49:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:49:35,672 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:35,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:35,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:49:35,672 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:35,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2112008133, now seen corresponding path program 1 times [2025-01-09 04:49:35,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100575817] [2025-01-09 04:49:35,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:35,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:49:35,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:49:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100575817] [2025-01-09 04:49:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100575817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410018562] [2025-01-09 04:49:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:36,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:36,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:36,012 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:36,385 INFO L93 Difference]: Finished difference Result 240 states and 305 transitions. [2025-01-09 04:49:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:36,385 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:36,386 INFO L225 Difference]: With dead ends: 240 [2025-01-09 04:49:36,386 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 04:49:36,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:36,386 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 696 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:36,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1211 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 04:49:36,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 155. [2025-01-09 04:49:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.2352941176470589) internal successors, (189), 154 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2025-01-09 04:49:36,388 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 71 [2025-01-09 04:49:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2025-01-09 04:49:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:36,389 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2025-01-09 04:49:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 04:49:36,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:36,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:36,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:49:36,389 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:36,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:36,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1776801356, now seen corresponding path program 1 times [2025-01-09 04:49:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338222961] [2025-01-09 04:49:36,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:36,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 04:49:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 04:49:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:36,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338222961] [2025-01-09 04:49:36,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338222961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:36,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:36,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 04:49:36,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973276050] [2025-01-09 04:49:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:36,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:49:36,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:36,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:49:36,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:49:36,759 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,049 INFO L93 Difference]: Finished difference Result 228 states and 291 transitions. [2025-01-09 04:49:37,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:49:37,049 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:37,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,050 INFO L225 Difference]: With dead ends: 228 [2025-01-09 04:49:37,050 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 04:49:37,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:49:37,050 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 534 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1323 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 04:49:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 129. [2025-01-09 04:49:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.2421875) internal successors, (159), 128 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2025-01-09 04:49:37,052 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 71 [2025-01-09 04:49:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,052 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2025-01-09 04:49:37,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 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-01-09 04:49:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2025-01-09 04:49:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 04:49:37,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 04:49:37,053 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash 161471129, now seen corresponding path program 1 times [2025-01-09 04:49:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188900506] [2025-01-09 04:49:37,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 04:49:37,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 04:49:37,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188900506] [2025-01-09 04:49:37,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188900506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356561878] [2025-01-09 04:49:37,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,117 INFO L87 Difference]: Start difference. First operand 129 states and 159 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,201 INFO L93 Difference]: Finished difference Result 561 states and 791 transitions. [2025-01-09 04:49:37,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:49:37,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 04:49:37,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,203 INFO L225 Difference]: With dead ends: 561 [2025-01-09 04:49:37,203 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 04:49:37,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:49:37,203 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 834 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1258 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:49:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 04:49:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 181. [2025-01-09 04:49:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2025-01-09 04:49:37,207 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 93 [2025-01-09 04:49:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,207 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2025-01-09 04:49:37,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2025-01-09 04:49:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:49:37,208 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash -880942767, now seen corresponding path program 1 times [2025-01-09 04:49:37,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867918837] [2025-01-09 04:49:37,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867918837] [2025-01-09 04:49:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867918837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689583944] [2025-01-09 04:49:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,281 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,350 INFO L93 Difference]: Finished difference Result 659 states and 932 transitions. [2025-01-09 04:49:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:37,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,352 INFO L225 Difference]: With dead ends: 659 [2025-01-09 04:49:37,352 INFO L226 Difference]: Without dead ends: 553 [2025-01-09 04:49:37,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:37,353 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 642 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 752 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-01-09 04:49:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 285. [2025-01-09 04:49:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 1.3661971830985915) internal successors, (388), 284 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-01-09 04:49:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2025-01-09 04:49:37,357 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 95 [2025-01-09 04:49:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,357 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2025-01-09 04:49:37,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2025-01-09 04:49:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:49:37,358 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash 284809815, now seen corresponding path program 1 times [2025-01-09 04:49:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716096580] [2025-01-09 04:49:37,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716096580] [2025-01-09 04:49:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716096580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054656378] [2025-01-09 04:49:37,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,470 INFO L87 Difference]: Start difference. First operand 285 states and 388 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,536 INFO L93 Difference]: Finished difference Result 763 states and 1085 transitions. [2025-01-09 04:49:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:37,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:37,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,538 INFO L225 Difference]: With dead ends: 763 [2025-01-09 04:49:37,538 INFO L226 Difference]: Without dead ends: 657 [2025-01-09 04:49:37,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:37,539 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 642 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 702 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-09 04:49:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 441. [2025-01-09 04:49:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.4022727272727273) internal successors, (617), 440 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 617 transitions. [2025-01-09 04:49:37,544 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 617 transitions. Word has length 95 [2025-01-09 04:49:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,544 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 617 transitions. [2025-01-09 04:49:37,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 617 transitions. [2025-01-09 04:49:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:49:37,545 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -736748582, now seen corresponding path program 1 times [2025-01-09 04:49:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541756190] [2025-01-09 04:49:37,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541756190] [2025-01-09 04:49:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541756190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340130305] [2025-01-09 04:49:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,657 INFO L87 Difference]: Start difference. First operand 441 states and 617 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,722 INFO L93 Difference]: Finished difference Result 809 states and 1155 transitions. [2025-01-09 04:49:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:37,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,723 INFO L225 Difference]: With dead ends: 809 [2025-01-09 04:49:37,723 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 04:49:37,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:49:37,724 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 451 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 04:49:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2025-01-09 04:49:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.393181818181818) internal successors, (613), 440 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 613 transitions. [2025-01-09 04:49:37,729 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 613 transitions. Word has length 95 [2025-01-09 04:49:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,729 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 613 transitions. [2025-01-09 04:49:37,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 613 transitions. [2025-01-09 04:49:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,730 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 04:49:37,730 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1506041575, now seen corresponding path program 1 times [2025-01-09 04:49:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052937469] [2025-01-09 04:49:37,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052937469] [2025-01-09 04:49:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052937469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809924110] [2025-01-09 04:49:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:37,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:37,762 INFO L87 Difference]: Start difference. First operand 441 states and 613 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,779 INFO L93 Difference]: Finished difference Result 1128 states and 1604 transitions. [2025-01-09 04:49:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:37,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,781 INFO L225 Difference]: With dead ends: 1128 [2025-01-09 04:49:37,781 INFO L226 Difference]: Without dead ends: 762 [2025-01-09 04:49:37,781 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-01-09 04:49:37,781 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 66 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 365 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-09 04:49:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 760. [2025-01-09 04:49:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 759 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1056 transitions. [2025-01-09 04:49:37,788 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1056 transitions. Word has length 95 [2025-01-09 04:49:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1056 transitions. [2025-01-09 04:49:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1056 transitions. [2025-01-09 04:49:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,789 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:49:37,789 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1675387619, now seen corresponding path program 1 times [2025-01-09 04:49:37,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341461540] [2025-01-09 04:49:37,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341461540] [2025-01-09 04:49:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341461540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292360618] [2025-01-09 04:49:37,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,855 INFO L87 Difference]: Start difference. First operand 760 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:37,912 INFO L93 Difference]: Finished difference Result 1550 states and 2181 transitions. [2025-01-09 04:49:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:37,915 INFO L225 Difference]: With dead ends: 1550 [2025-01-09 04:49:37,915 INFO L226 Difference]: Without dead ends: 1353 [2025-01-09 04:49:37,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:37,916 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 607 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:37,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 760 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-01-09 04:49:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 955. [2025-01-09 04:49:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 1.39832285115304) internal successors, (1334), 954 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1334 transitions. [2025-01-09 04:49:37,925 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1334 transitions. Word has length 95 [2025-01-09 04:49:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1334 transitions. [2025-01-09 04:49:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1334 transitions. [2025-01-09 04:49:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 04:49:37,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:37,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:37,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:49:37,926 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:37,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1554031907, now seen corresponding path program 1 times [2025-01-09 04:49:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982838028] [2025-01-09 04:49:37,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:37,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:37,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 04:49:37,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 04:49:37,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:37,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:37,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982838028] [2025-01-09 04:49:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982838028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710146690] [2025-01-09 04:49:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:37,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:37,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:37,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:37,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:37,994 INFO L87 Difference]: Start difference. First operand 955 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:38,049 INFO L93 Difference]: Finished difference Result 1745 states and 2459 transitions. [2025-01-09 04:49:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-01-09 04:49:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:38,053 INFO L225 Difference]: With dead ends: 1745 [2025-01-09 04:49:38,053 INFO L226 Difference]: Without dead ends: 1548 [2025-01-09 04:49:38,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:49:38,053 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 577 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:38,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 807 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-01-09 04:49:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1150. [2025-01-09 04:49:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4029590948651) internal successors, (1612), 1149 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1612 transitions. [2025-01-09 04:49:38,067 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1612 transitions. Word has length 95 [2025-01-09 04:49:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:38,067 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1612 transitions. [2025-01-09 04:49:38,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1612 transitions. [2025-01-09 04:49:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 04:49:38,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:38,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:38,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:49:38,068 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:38,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1423537109, now seen corresponding path program 1 times [2025-01-09 04:49:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:38,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069285273] [2025-01-09 04:49:38,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:38,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 04:49:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 04:49:38,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:38,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:38,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069285273] [2025-01-09 04:49:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069285273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:38,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:38,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:38,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557695997] [2025-01-09 04:49:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:38,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:38,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:38,126 INFO L87 Difference]: Start difference. First operand 1150 states and 1612 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:38,141 INFO L93 Difference]: Finished difference Result 2882 states and 4059 transitions. [2025-01-09 04:49:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:38,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-01-09 04:49:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:38,145 INFO L225 Difference]: With dead ends: 2882 [2025-01-09 04:49:38,145 INFO L226 Difference]: Without dead ends: 1807 [2025-01-09 04:49:38,146 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-01-09 04:49:38,147 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 341 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-01-09 04:49:38,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:38,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-01-09 04:49:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1717. [2025-01-09 04:49:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1716 states have (on average 1.3951048951048952) internal successors, (2394), 1716 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2394 transitions. [2025-01-09 04:49:38,188 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2394 transitions. Word has length 96 [2025-01-09 04:49:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:38,188 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2394 transitions. [2025-01-09 04:49:38,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2394 transitions. [2025-01-09 04:49:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 04:49:38,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:38,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:49:38,193 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1571382276, now seen corresponding path program 1 times [2025-01-09 04:49:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763665157] [2025-01-09 04:49:38,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:38,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 04:49:38,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 04:49:38,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:38,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763665157] [2025-01-09 04:49:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763665157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195556862] [2025-01-09 04:49:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:38,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:38,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:38,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:38,293 INFO L87 Difference]: Start difference. First operand 1717 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:38,311 INFO L93 Difference]: Finished difference Result 4869 states and 6791 transitions. [2025-01-09 04:49:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:38,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-01-09 04:49:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:38,318 INFO L225 Difference]: With dead ends: 4869 [2025-01-09 04:49:38,318 INFO L226 Difference]: Without dead ends: 3227 [2025-01-09 04:49:38,320 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-01-09 04:49:38,320 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 341 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-01-09 04:49:38,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 341 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2025-01-09 04:49:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3093. [2025-01-09 04:49:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3092 states have (on average 1.3835705045278137) internal successors, (4278), 3092 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 4278 transitions. [2025-01-09 04:49:38,369 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 4278 transitions. Word has length 97 [2025-01-09 04:49:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:38,370 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 4278 transitions. [2025-01-09 04:49:38,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 4278 transitions. [2025-01-09 04:49:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:49:38,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:38,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 04:49:38,371 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:38,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:38,371 INFO L85 PathProgramCache]: Analyzing trace with hash 584515800, now seen corresponding path program 1 times [2025-01-09 04:49:38,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537885268] [2025-01-09 04:49:38,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:38,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:49:38,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:49:38,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:38,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:38,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:38,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537885268] [2025-01-09 04:49:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537885268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760581387] [2025-01-09 04:49:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:38,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:38,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:38,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:38,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:38,443 INFO L87 Difference]: Start difference. First operand 3093 states and 4278 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:38,464 INFO L93 Difference]: Finished difference Result 8865 states and 12212 transitions. [2025-01-09 04:49:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:38,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-01-09 04:49:38,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:38,476 INFO L225 Difference]: With dead ends: 8865 [2025-01-09 04:49:38,476 INFO L226 Difference]: Without dead ends: 5847 [2025-01-09 04:49:38,479 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-01-09 04:49:38,479 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 63 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 340 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-01-09 04:49:38,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 340 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:38,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2025-01-09 04:49:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5581. [2025-01-09 04:49:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5581 states, 5580 states have (on average 1.3650537634408602) internal successors, (7617), 5580 states have internal predecessors, (7617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 7617 transitions. [2025-01-09 04:49:38,533 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 7617 transitions. Word has length 98 [2025-01-09 04:49:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:38,533 INFO L471 AbstractCegarLoop]: Abstraction has 5581 states and 7617 transitions. [2025-01-09 04:49:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 7617 transitions. [2025-01-09 04:49:38,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:49:38,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:38,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:38,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 04:49:38,533 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:38,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:38,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1344323197, now seen corresponding path program 1 times [2025-01-09 04:49:38,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:38,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5914079] [2025-01-09 04:49:38,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:38,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:38,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:49:38,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:49:38,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:38,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:38,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5914079] [2025-01-09 04:49:38,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5914079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:38,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:38,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:38,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139394932] [2025-01-09 04:49:38,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:38,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:38,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:38,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:38,649 INFO L87 Difference]: Start difference. First operand 5581 states and 7617 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:38,700 INFO L93 Difference]: Finished difference Result 16065 states and 21767 transitions. [2025-01-09 04:49:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 04:49:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:38,732 INFO L225 Difference]: With dead ends: 16065 [2025-01-09 04:49:38,732 INFO L226 Difference]: Without dead ends: 10559 [2025-01-09 04:49:38,740 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-01-09 04:49:38,742 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 53 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:38,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 338 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:38,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-01-09 04:49:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 10029. [2025-01-09 04:49:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10029 states, 10028 states have (on average 1.3399481451934583) internal successors, (13437), 10028 states have internal predecessors, (13437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10029 states to 10029 states and 13437 transitions. [2025-01-09 04:49:38,858 INFO L78 Accepts]: Start accepts. Automaton has 10029 states and 13437 transitions. Word has length 99 [2025-01-09 04:49:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:38,858 INFO L471 AbstractCegarLoop]: Abstraction has 10029 states and 13437 transitions. [2025-01-09 04:49:38,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 10029 states and 13437 transitions. [2025-01-09 04:49:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:49:38,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:38,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:38,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:49:38,859 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:38,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -445596435, now seen corresponding path program 1 times [2025-01-09 04:49:38,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225936578] [2025-01-09 04:49:38,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:49:38,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:49:38,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:38,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225936578] [2025-01-09 04:49:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225936578] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:49:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729239246] [2025-01-09 04:49:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:49:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:49:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:49:39,051 INFO L87 Difference]: Start difference. First operand 10029 states and 13437 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:39,086 INFO L93 Difference]: Finished difference Result 10271 states and 13758 transitions. [2025-01-09 04:49:39,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:49:39,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-09 04:49:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:39,138 INFO L225 Difference]: With dead ends: 10271 [2025-01-09 04:49:39,139 INFO L226 Difference]: Without dead ends: 10269 [2025-01-09 04:49:39,140 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-01-09 04:49:39,141 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:39,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2025-01-09 04:49:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 10269. [2025-01-09 04:49:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10269 states, 10268 states have (on average 1.322652902220491) internal successors, (13581), 10268 states have internal predecessors, (13581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 13581 transitions. [2025-01-09 04:49:39,220 INFO L78 Accepts]: Start accepts. Automaton has 10269 states and 13581 transitions. Word has length 100 [2025-01-09 04:49:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:39,222 INFO L471 AbstractCegarLoop]: Abstraction has 10269 states and 13581 transitions. [2025-01-09 04:49:39,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 10269 states and 13581 transitions. [2025-01-09 04:49:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 04:49:39,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:39,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:49:39,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 04:49:39,223 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1981290545, now seen corresponding path program 1 times [2025-01-09 04:49:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190111598] [2025-01-09 04:49:39,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:39,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 04:49:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 04:49:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:39,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-01-09 04:49:39,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:39,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190111598] [2025-01-09 04:49:39,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190111598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:49:39,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:49:39,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:49:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243782023] [2025-01-09 04:49:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:49:39,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:49:39,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:39,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:49:39,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:49:39,262 INFO L87 Difference]: Start difference. First operand 10269 states and 13581 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:39,310 INFO L93 Difference]: Finished difference Result 20785 states and 27511 transitions. [2025-01-09 04:49:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:49:39,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-01-09 04:49:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:39,327 INFO L225 Difference]: With dead ends: 20785 [2025-01-09 04:49:39,327 INFO L226 Difference]: Without dead ends: 10591 [2025-01-09 04:49:39,336 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-01-09 04:49:39,337 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 86 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:39,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 280 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:49:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2025-01-09 04:49:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10589. [2025-01-09 04:49:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10589 states, 10588 states have (on average 1.305723460521345) internal successors, (13825), 10588 states have internal predecessors, (13825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 13825 transitions. [2025-01-09 04:49:39,470 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 13825 transitions. Word has length 100 [2025-01-09 04:49:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:39,470 INFO L471 AbstractCegarLoop]: Abstraction has 10589 states and 13825 transitions. [2025-01-09 04:49:39,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 13825 transitions. [2025-01-09 04:49:39,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 04:49:39,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:39,472 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] [2025-01-09 04:49:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:49:39,473 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:39,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:39,473 INFO L85 PathProgramCache]: Analyzing trace with hash 642240657, now seen corresponding path program 1 times [2025-01-09 04:49:39,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:39,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087728292] [2025-01-09 04:49:39,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:39,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:39,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:49:39,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:49:39,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:39,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087728292] [2025-01-09 04:49:39,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087728292] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:39,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836631103] [2025-01-09 04:49:39,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:39,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:39,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:39,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:39,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:49:40,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 04:49:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 04:49:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:40,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 04:49:40,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:40,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836631103] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:41,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-01-09 04:49:41,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520697650] [2025-01-09 04:49:41,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 04:49:41,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:41,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 04:49:41,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-01-09 04:49:41,922 INFO L87 Difference]: Start difference. First operand 10589 states and 13825 transitions. Second operand has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:48,725 INFO L93 Difference]: Finished difference Result 91528 states and 119238 transitions. [2025-01-09 04:49:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-01-09 04:49:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-01-09 04:49:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:48,932 INFO L225 Difference]: With dead ends: 91528 [2025-01-09 04:49:48,932 INFO L226 Difference]: Without dead ends: 81014 [2025-01-09 04:49:48,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10670 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4750, Invalid=27470, Unknown=0, NotChecked=0, Total=32220 [2025-01-09 04:49:48,955 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 4020 mSDsluCounter, 3187 mSDsCounter, 0 mSdLazyCounter, 4637 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4020 SdHoareTripleChecker+Valid, 3412 SdHoareTripleChecker+Invalid, 4725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 4637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:48,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4020 Valid, 3412 Invalid, 4725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 4637 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:49:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81014 states. [2025-01-09 04:49:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81014 to 53369. [2025-01-09 04:49:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53369 states, 53368 states have (on average 1.2972005696297406) internal successors, (69229), 53368 states have internal predecessors, (69229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53369 states to 53369 states and 69229 transitions. [2025-01-09 04:49:49,805 INFO L78 Accepts]: Start accepts. Automaton has 53369 states and 69229 transitions. Word has length 127 [2025-01-09 04:49:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:49,805 INFO L471 AbstractCegarLoop]: Abstraction has 53369 states and 69229 transitions. [2025-01-09 04:49:49,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 53369 states and 69229 transitions. [2025-01-09 04:49:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:49:49,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:49,818 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] [2025-01-09 04:49:49,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:49:50,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-01-09 04:49:50,019 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:50,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash -895889741, now seen corresponding path program 1 times [2025-01-09 04:49:50,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:50,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590529009] [2025-01-09 04:49:50,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:50,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:49:50,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:49:50,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:50,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590529009] [2025-01-09 04:49:50,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590529009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:50,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845286590] [2025-01-09 04:49:50,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:50,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:50,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:49:50,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 04:49:50,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:49:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:50,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:49:50,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:51,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:49:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845286590] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:49:51,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:49:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 27 [2025-01-09 04:49:51,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331048562] [2025-01-09 04:49:51,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:49:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 04:49:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:49:51,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 04:49:51,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2025-01-09 04:49:51,606 INFO L87 Difference]: Start difference. First operand 53369 states and 69229 transitions. Second operand has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:49:55,316 INFO L93 Difference]: Finished difference Result 266571 states and 347338 transitions. [2025-01-09 04:49:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-01-09 04:49:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-01-09 04:49:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:49:55,736 INFO L225 Difference]: With dead ends: 266571 [2025-01-09 04:49:55,736 INFO L226 Difference]: Without dead ends: 213340 [2025-01-09 04:49:55,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4427 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2065, Invalid=12215, Unknown=0, NotChecked=0, Total=14280 [2025-01-09 04:49:55,788 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 4135 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4135 SdHoareTripleChecker+Valid, 2837 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:49:55,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4135 Valid, 2837 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:49:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213340 states. [2025-01-09 04:49:57,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213340 to 132282. [2025-01-09 04:49:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132282 states, 132281 states have (on average 1.2940331566891692) internal successors, (171176), 132281 states have internal predecessors, (171176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132282 states to 132282 states and 171176 transitions. [2025-01-09 04:49:57,765 INFO L78 Accepts]: Start accepts. Automaton has 132282 states and 171176 transitions. Word has length 128 [2025-01-09 04:49:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:49:57,765 INFO L471 AbstractCegarLoop]: Abstraction has 132282 states and 171176 transitions. [2025-01-09 04:49:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:49:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 132282 states and 171176 transitions. [2025-01-09 04:49:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 04:49:57,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:49:57,775 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] [2025-01-09 04:49:57,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:49:57,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:57,976 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-01-09 04:49:57,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:49:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1950563265, now seen corresponding path program 1 times [2025-01-09 04:49:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:49:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6782051] [2025-01-09 04:49:57,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:49:57,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 04:49:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 04:49:58,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:58,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:58,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:49:58,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6782051] [2025-01-09 04:49:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6782051] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:49:58,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150817188] [2025-01-09 04:49:58,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:49:58,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:49:58,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:49:58,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:49:58,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:49:59,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 04:49:59,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 04:49:59,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:49:59,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:49:59,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 04:49:59,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:49:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:49:59,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:50:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:50:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150817188] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:50:00,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:50:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9, 9] total 32 [2025-01-09 04:50:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842131984] [2025-01-09 04:50:00,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:50:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 04:50:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:50:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 04:50:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2025-01-09 04:50:00,153 INFO L87 Difference]: Start difference. First operand 132282 states and 171176 transitions. Second operand has 32 states, 32 states have (on average 10.75) internal successors, (344), 32 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:50:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:50:21,730 INFO L93 Difference]: Finished difference Result 999625 states and 1299007 transitions. [2025-01-09 04:50:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 413 states. [2025-01-09 04:50:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.75) internal successors, (344), 32 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-01-09 04:50:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:50:24,339 INFO L225 Difference]: With dead ends: 999625 [2025-01-09 04:50:24,339 INFO L226 Difference]: Without dead ends: 910573 [2025-01-09 04:50:24,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 441 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85963 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=14681, Invalid=181125, Unknown=0, NotChecked=0, Total=195806 [2025-01-09 04:50:24,575 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 9036 mSDsluCounter, 5648 mSDsCounter, 0 mSdLazyCounter, 8813 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9036 SdHoareTripleChecker+Valid, 5992 SdHoareTripleChecker+Invalid, 9047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 8813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:50:24,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9036 Valid, 5992 Invalid, 9047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 8813 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 04:50:24,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910573 states.