./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 c00e63dc 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-?-c00e63d-m [2025-02-05 16:40:27,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:40:27,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:40:27,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:40:27,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:40:27,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:40:27,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:40:27,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:40:27,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:40:27,316 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:40:27,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:40:27,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:40:27,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:40:27,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:40:27,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:40:27,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:40:27,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:40:27,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:27,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:40:27,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:40:27,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:40:27,319 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-02-05 16:40:27,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:40:27,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:40:27,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:40:27,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:40:27,587 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:40:27,588 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-02-05 16:40:28,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c898cc101/df6e670532194fdfa50e49bb475d61bc/FLAG508aa1f88 [2025-02-05 16:40:29,078 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:40:29,080 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-02-05 16:40:29,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c898cc101/df6e670532194fdfa50e49bb475d61bc/FLAG508aa1f88 [2025-02-05 16:40:29,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c898cc101/df6e670532194fdfa50e49bb475d61bc [2025-02-05 16:40:29,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:40:29,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:40:29,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:29,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:40:29,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:40:29,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764cba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29, skipping insertion in model container [2025-02-05 16:40:29,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:40:29,366 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-02-05 16:40:29,389 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-02-05 16:40:29,396 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-02-05 16:40:29,400 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-02-05 16:40:29,410 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-02-05 16:40:29,414 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-02-05 16:40:29,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[17864,17877] [2025-02-05 16:40:29,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[20202,20215] [2025-02-05 16:40:29,439 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-02-05 16:40:29,446 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-02-05 16:40:29,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[23760,23773] [2025-02-05 16:40:29,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:29,562 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:40:29,615 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-02-05 16:40:29,622 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-02-05 16:40:29,625 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-02-05 16:40:29,627 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-02-05 16:40:29,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[16224,16237] [2025-02-05 16:40:29,631 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-02-05 16:40:29,633 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-02-05 16:40:29,637 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-02-05 16:40:29,639 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-02-05 16:40:29,641 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-02-05 16:40:29,644 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-02-05 16:40:29,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:40:29,692 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:40:29,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29 WrapperNode [2025-02-05 16:40:29,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:40:29,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:29,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:40:29,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:40:29,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,785 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2020 [2025-02-05 16:40:29,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:40:29,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:40:29,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:40:29,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:40:29,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,830 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-02-05 16:40:29,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,859 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:40:29,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:40:29,860 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:40:29,860 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:40:29,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (1/1) ... [2025-02-05 16:40:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:29,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:29,895 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-02-05 16:40:29,906 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-02-05 16:40:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:40:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:40:29,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:40:29,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:40:30,056 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:40:30,057 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2810: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292: havoc main_~node3__m3~4#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node3__m3~2#1; [2025-02-05 16:40:30,979 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2384: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2584: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3014: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2453: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L835: havoc main_~node4__m4~3#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L703: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1398: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2224: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1002: havoc main_~node4__m4~4#1; [2025-02-05 16:40:30,980 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1201: havoc main_~check__tmp~9#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1135: havoc main_~node4__m4~5#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2093: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1169: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2854: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1566: havoc main_~node3__m3~5#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1930: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc main_~node4__m4~1#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2924: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node2__m2~1#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:40:30,981 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2793: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1307: havoc main_~node4__m4~6#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node4__m4~2#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2630: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~7#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1508: havoc main_~check__tmp~13#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1277: havoc main_~node2__m2~3#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node2__m2~2#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2270: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1974: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1710: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2470: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L787: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1349: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc main_~check__tmp~15#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1581: havoc main_~node4__m4~8#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2110: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2044: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: havoc main_~node3__m3~3#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1615: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node3__m3~1#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:40:30,982 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1884: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:40:30,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:40:30,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:40:31,032 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2025-02-05 16:40:31,033 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:40:31,045 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:40:31,045 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:40:31,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:31 BoogieIcfgContainer [2025-02-05 16:40:31,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:40:31,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:40:31,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:40:31,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:40:31,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:40:29" (1/3) ... [2025-02-05 16:40:31,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c82aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:31, skipping insertion in model container [2025-02-05 16:40:31,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:40:29" (2/3) ... [2025-02-05 16:40:31,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c82aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:31, skipping insertion in model container [2025-02-05 16:40:31,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:31" (3/3) ... [2025-02-05 16:40:31,051 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:40:31,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:40:31,070 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-02-05 16:40:31,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:40:31,168 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;@365f72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:40:31,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-05 16:40:31,179 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-02-05 16:40:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:40:31,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:31,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:31,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:31,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1251606518, now seen corresponding path program 1 times [2025-02-05 16:40:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:31,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127053138] [2025-02-05 16:40:31,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:40:31,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:40:31,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:31,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:31,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127053138] [2025-02-05 16:40:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127053138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:31,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359578378] [2025-02-05 16:40:31,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:31,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:31,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:31,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:31,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:31,695 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-02-05 16:40:32,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:32,129 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2025-02-05 16:40:32,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:32,135 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-02-05 16:40:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:32,145 INFO L225 Difference]: With dead ends: 570 [2025-02-05 16:40:32,148 INFO L226 Difference]: Without dead ends: 294 [2025-02-05 16:40:32,151 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-02-05 16:40:32,157 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1459 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:32,158 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.4s Time] [2025-02-05 16:40:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-05 16:40:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-02-05 16:40:32,198 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-02-05 16:40:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2025-02-05 16:40:32,204 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 59 [2025-02-05 16:40:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:32,204 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2025-02-05 16:40:32,204 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-02-05 16:40:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2025-02-05 16:40:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:32,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:32,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:32,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:40:32,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 691292483, now seen corresponding path program 1 times [2025-02-05 16:40:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147110834] [2025-02-05 16:40:32,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:32,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:32,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:32,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:32,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147110834] [2025-02-05 16:40:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147110834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940928889] [2025-02-05 16:40:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:32,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:32,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:32,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:32,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:32,441 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-02-05 16:40:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:32,623 INFO L93 Difference]: Finished difference Result 497 states and 636 transitions. [2025-02-05 16:40:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:32,624 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-02-05 16:40:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:32,625 INFO L225 Difference]: With dead ends: 497 [2025-02-05 16:40:32,625 INFO L226 Difference]: Without dead ends: 274 [2025-02-05 16:40:32,626 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-02-05 16:40:32,626 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:32,626 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.1s Time] [2025-02-05 16:40:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-05 16:40:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-02-05 16:40:32,633 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-02-05 16:40:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2025-02-05 16:40:32,633 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 60 [2025-02-05 16:40:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:32,634 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2025-02-05 16:40:32,634 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-02-05 16:40:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2025-02-05 16:40:32,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:40:32,635 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:32,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:32,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:40:32,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:32,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1715255438, now seen corresponding path program 1 times [2025-02-05 16:40:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354567781] [2025-02-05 16:40:32,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:32,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:40:32,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:40:32,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:32,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:32,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354567781] [2025-02-05 16:40:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354567781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:32,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:32,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136722956] [2025-02-05 16:40:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:32,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:32,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:32,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:32,782 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-02-05 16:40:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:32,953 INFO L93 Difference]: Finished difference Result 477 states and 610 transitions. [2025-02-05 16:40:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:32,954 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-02-05 16:40:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:32,955 INFO L225 Difference]: With dead ends: 477 [2025-02-05 16:40:32,955 INFO L226 Difference]: Without dead ends: 255 [2025-02-05 16:40:32,955 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-02-05 16:40:32,956 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-02-05 16:40:32,956 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-02-05 16:40:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-05 16:40:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-05 16:40:32,961 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-02-05 16:40:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 320 transitions. [2025-02-05 16:40:32,962 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 320 transitions. Word has length 61 [2025-02-05 16:40:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:32,963 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 320 transitions. [2025-02-05 16:40:32,963 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-02-05 16:40:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 320 transitions. [2025-02-05 16:40:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:40:32,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:32,964 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:32,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:40:32,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1987134437, now seen corresponding path program 1 times [2025-02-05 16:40:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351089714] [2025-02-05 16:40:32,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:32,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:32,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:40:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:40:32,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:32,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:33,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351089714] [2025-02-05 16:40:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351089714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:33,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501515264] [2025-02-05 16:40:33,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:33,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:33,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:33,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:33,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:33,072 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-02-05 16:40:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:33,205 INFO L93 Difference]: Finished difference Result 458 states and 587 transitions. [2025-02-05 16:40:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:33,205 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-02-05 16:40:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:33,206 INFO L225 Difference]: With dead ends: 458 [2025-02-05 16:40:33,206 INFO L226 Difference]: Without dead ends: 247 [2025-02-05 16:40:33,207 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-02-05 16:40:33,207 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-02-05 16:40:33,207 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-02-05 16:40:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-05 16:40:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-02-05 16:40:33,211 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-02-05 16:40:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 310 transitions. [2025-02-05 16:40:33,212 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 310 transitions. Word has length 62 [2025-02-05 16:40:33,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:33,212 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 310 transitions. [2025-02-05 16:40:33,212 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-02-05 16:40:33,212 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 310 transitions. [2025-02-05 16:40:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:33,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:33,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:33,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:40:33,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -213127066, now seen corresponding path program 1 times [2025-02-05 16:40:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376214419] [2025-02-05 16:40:33,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:33,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:33,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:33,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:33,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:33,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376214419] [2025-02-05 16:40:33,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376214419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:33,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:33,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:40:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569308272] [2025-02-05 16:40:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:40:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:33,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:40:33,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:33,534 INFO L87 Difference]: Start difference. First operand 247 states and 310 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-02-05 16:40:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:33,888 INFO L93 Difference]: Finished difference Result 486 states and 610 transitions. [2025-02-05 16:40:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:40:33,888 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-02-05 16:40:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:33,890 INFO L225 Difference]: With dead ends: 486 [2025-02-05 16:40:33,890 INFO L226 Difference]: Without dead ends: 353 [2025-02-05 16:40:33,890 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-02-05 16:40:33,891 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1282 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:33,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 758 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-05 16:40:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 247. [2025-02-05 16:40:33,895 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-02-05 16:40:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2025-02-05 16:40:33,896 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 63 [2025-02-05 16:40:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:33,896 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2025-02-05 16:40:33,896 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-02-05 16:40:33,896 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2025-02-05 16:40:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:33,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:33,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:40:33,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:33,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -633020883, now seen corresponding path program 1 times [2025-02-05 16:40:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:33,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457167584] [2025-02-05 16:40:33,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:33,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:33,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:33,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:33,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:34,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-02-05 16:40:34,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:34,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457167584] [2025-02-05 16:40:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457167584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823165262] [2025-02-05 16:40:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:34,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:34,139 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-02-05 16:40:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:34,592 INFO L93 Difference]: Finished difference Result 471 states and 607 transitions. [2025-02-05 16:40:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:34,592 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-02-05 16:40:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:34,593 INFO L225 Difference]: With dead ends: 471 [2025-02-05 16:40:34,594 INFO L226 Difference]: Without dead ends: 383 [2025-02-05 16:40:34,594 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-02-05 16:40:34,594 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1323 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:34,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1229 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-05 16:40:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 247. [2025-02-05 16:40:34,598 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-02-05 16:40:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 308 transitions. [2025-02-05 16:40:34,599 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 308 transitions. Word has length 63 [2025-02-05 16:40:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:34,599 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 308 transitions. [2025-02-05 16:40:34,599 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-02-05 16:40:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 308 transitions. [2025-02-05 16:40:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:40:34,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:34,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:40:34,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:34,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -406599686, now seen corresponding path program 1 times [2025-02-05 16:40:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293981716] [2025-02-05 16:40:34,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:34,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:40:34,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:40:34,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:34,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:34,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293981716] [2025-02-05 16:40:34,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293981716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:34,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:34,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:34,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190436778] [2025-02-05 16:40:34,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:34,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:34,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:34,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:34,825 INFO L87 Difference]: Start difference. First operand 247 states and 308 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-02-05 16:40:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:35,216 INFO L93 Difference]: Finished difference Result 445 states and 573 transitions. [2025-02-05 16:40:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:35,217 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-02-05 16:40:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:35,218 INFO L225 Difference]: With dead ends: 445 [2025-02-05 16:40:35,218 INFO L226 Difference]: Without dead ends: 379 [2025-02-05 16:40:35,218 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-02-05 16:40:35,219 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1277 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:35,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1016 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-05 16:40:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 247. [2025-02-05 16:40:35,223 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-02-05 16:40:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2025-02-05 16:40:35,223 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 63 [2025-02-05 16:40:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:35,224 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2025-02-05 16:40:35,224 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-02-05 16:40:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2025-02-05 16:40:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:35,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:35,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:35,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:40:35,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:35,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:35,225 INFO L85 PathProgramCache]: Analyzing trace with hash 323489165, now seen corresponding path program 1 times [2025-02-05 16:40:35,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:35,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137398524] [2025-02-05 16:40:35,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:35,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:35,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:35,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:35,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:35,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:35,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137398524] [2025-02-05 16:40:35,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137398524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:35,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514775300] [2025-02-05 16:40:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:35,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:35,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:35,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:35,412 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-02-05 16:40:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:35,818 INFO L93 Difference]: Finished difference Result 450 states and 577 transitions. [2025-02-05 16:40:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:35,818 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-02-05 16:40:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:35,819 INFO L225 Difference]: With dead ends: 450 [2025-02-05 16:40:35,819 INFO L226 Difference]: Without dead ends: 379 [2025-02-05 16:40:35,820 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-02-05 16:40:35,820 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1272 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:35,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 1001 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-02-05 16:40:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 247. [2025-02-05 16:40:35,827 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-02-05 16:40:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 306 transitions. [2025-02-05 16:40:35,827 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 306 transitions. Word has length 65 [2025-02-05 16:40:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:35,828 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 306 transitions. [2025-02-05 16:40:35,828 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-02-05 16:40:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 306 transitions. [2025-02-05 16:40:35,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:35,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:35,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:35,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:40:35,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:35,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1910527089, now seen corresponding path program 1 times [2025-02-05 16:40:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:35,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065109697] [2025-02-05 16:40:35,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:35,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:35,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:35,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:36,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-02-05 16:40:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:36,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065109697] [2025-02-05 16:40:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065109697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:36,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821278274] [2025-02-05 16:40:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:36,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:36,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:36,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:36,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:36,051 INFO L87 Difference]: Start difference. First operand 247 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-02-05 16:40:36,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:36,406 INFO L93 Difference]: Finished difference Result 430 states and 546 transitions. [2025-02-05 16:40:36,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:36,407 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-02-05 16:40:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:36,408 INFO L225 Difference]: With dead ends: 430 [2025-02-05 16:40:36,408 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 16:40:36,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:36,409 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 774 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:36,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 829 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 16:40:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2025-02-05 16:40:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 246 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-02-05 16:40:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 305 transitions. [2025-02-05 16:40:36,413 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 305 transitions. Word has length 65 [2025-02-05 16:40:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:36,413 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 305 transitions. [2025-02-05 16:40:36,413 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-02-05 16:40:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 305 transitions. [2025-02-05 16:40:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:36,414 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:36,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:36,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:40:36,414 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-02-05 16:40:36,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -449473030, now seen corresponding path program 1 times [2025-02-05 16:40:36,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:36,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111970118] [2025-02-05 16:40:36,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:36,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:36,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:36,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:36,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:36,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111970118] [2025-02-05 16:40:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111970118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:36,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:36,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:36,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787297848] [2025-02-05 16:40:36,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:36,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:36,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:36,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:36,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:36,928 INFO L87 Difference]: Start difference. First operand 247 states and 305 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-02-05 16:40:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:37,643 INFO L93 Difference]: Finished difference Result 518 states and 669 transitions. [2025-02-05 16:40:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:40:37,643 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-02-05 16:40:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:37,645 INFO L225 Difference]: With dead ends: 518 [2025-02-05 16:40:37,645 INFO L226 Difference]: Without dead ends: 513 [2025-02-05 16:40:37,646 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-02-05 16:40:37,646 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 2818 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2818 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:37,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2818 Valid, 867 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:37,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-02-05 16:40:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 251. [2025-02-05 16:40:37,652 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-02-05 16:40:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 309 transitions. [2025-02-05 16:40:37,653 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 309 transitions. Word has length 65 [2025-02-05 16:40:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:37,653 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 309 transitions. [2025-02-05 16:40:37,653 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-02-05 16:40:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 309 transitions. [2025-02-05 16:40:37,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:37,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:37,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:37,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:40:37,654 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-02-05 16:40:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash -71533182, now seen corresponding path program 1 times [2025-02-05 16:40:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772322230] [2025-02-05 16:40:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:37,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:37,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:37,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:37,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772322230] [2025-02-05 16:40:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772322230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385208037] [2025-02-05 16:40:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:37,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:37,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:37,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:37,852 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-02-05 16:40:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:38,227 INFO L93 Difference]: Finished difference Result 427 states and 541 transitions. [2025-02-05 16:40:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:38,228 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-02-05 16:40:38,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:38,229 INFO L225 Difference]: With dead ends: 427 [2025-02-05 16:40:38,229 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 16:40:38,229 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-02-05 16:40:38,230 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1615 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 817 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-02-05 16:40:38,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 817 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 16:40:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 251. [2025-02-05 16:40:38,233 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-02-05 16:40:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 308 transitions. [2025-02-05 16:40:38,234 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 308 transitions. Word has length 65 [2025-02-05 16:40:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:38,234 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 308 transitions. [2025-02-05 16:40:38,234 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-02-05 16:40:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 308 transitions. [2025-02-05 16:40:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:38,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:38,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:40:38,235 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-02-05 16:40:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1530236826, now seen corresponding path program 1 times [2025-02-05 16:40:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069996046] [2025-02-05 16:40:38,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:38,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:38,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:38,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:38,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:38,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:38,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069996046] [2025-02-05 16:40:38,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069996046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:38,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:38,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:38,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569109026] [2025-02-05 16:40:38,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:38,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:38,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:38,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:38,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:38,379 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-02-05 16:40:38,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:38,759 INFO L93 Difference]: Finished difference Result 481 states and 611 transitions. [2025-02-05 16:40:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:38,759 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-02-05 16:40:38,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:38,760 INFO L225 Difference]: With dead ends: 481 [2025-02-05 16:40:38,761 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 16:40:38,761 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-02-05 16:40:38,761 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 704 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:38,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 999 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 16:40:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 251. [2025-02-05 16:40:38,765 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-02-05 16:40:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 307 transitions. [2025-02-05 16:40:38,766 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 307 transitions. Word has length 65 [2025-02-05 16:40:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:38,766 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 307 transitions. [2025-02-05 16:40:38,766 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-02-05 16:40:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 307 transitions. [2025-02-05 16:40:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:38,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:38,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:38,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:40:38,767 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:38,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:38,767 INFO L85 PathProgramCache]: Analyzing trace with hash -900054424, now seen corresponding path program 1 times [2025-02-05 16:40:38,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:38,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971232108] [2025-02-05 16:40:38,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:38,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:38,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:38,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:38,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:38,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:38,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:38,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971232108] [2025-02-05 16:40:38,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971232108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:38,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:38,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:38,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760302572] [2025-02-05 16:40:38,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:38,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:38,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:38,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:38,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:38,927 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-02-05 16:40:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:39,321 INFO L93 Difference]: Finished difference Result 400 states and 495 transitions. [2025-02-05 16:40:39,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:39,322 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-02-05 16:40:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:39,323 INFO L225 Difference]: With dead ends: 400 [2025-02-05 16:40:39,323 INFO L226 Difference]: Without dead ends: 383 [2025-02-05 16:40:39,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:39,324 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 638 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:39,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1134 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:39,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-05 16:40:39,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 251. [2025-02-05 16:40:39,327 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-02-05 16:40:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2025-02-05 16:40:39,328 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 65 [2025-02-05 16:40:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:39,328 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2025-02-05 16:40:39,328 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-02-05 16:40:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2025-02-05 16:40:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:40:39,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:39,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:39,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:40:39,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1160896618, now seen corresponding path program 1 times [2025-02-05 16:40:39,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:39,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58258256] [2025-02-05 16:40:39,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:40:39,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:40:39,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:39,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58258256] [2025-02-05 16:40:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58258256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:39,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:39,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052880931] [2025-02-05 16:40:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:39,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:39,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:39,510 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-02-05 16:40:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:39,899 INFO L93 Difference]: Finished difference Result 376 states and 461 transitions. [2025-02-05 16:40:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:39,899 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-02-05 16:40:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:39,900 INFO L225 Difference]: With dead ends: 376 [2025-02-05 16:40:39,901 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 16:40:39,901 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-02-05 16:40:39,902 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1355 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:39,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 983 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 16:40:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 251. [2025-02-05 16:40:39,906 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-02-05 16:40:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 305 transitions. [2025-02-05 16:40:39,907 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 305 transitions. Word has length 65 [2025-02-05 16:40:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 305 transitions. [2025-02-05 16:40:39,907 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-02-05 16:40:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 305 transitions. [2025-02-05 16:40:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:39,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:39,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:39,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:40:39,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 571325577, now seen corresponding path program 1 times [2025-02-05 16:40:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149579141] [2025-02-05 16:40:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:39,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:39,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:39,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:39,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:40,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-02-05 16:40:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149579141] [2025-02-05 16:40:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149579141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:40,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942217579] [2025-02-05 16:40:40,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:40,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:40,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:40,050 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-02-05 16:40:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:40,471 INFO L93 Difference]: Finished difference Result 376 states and 460 transitions. [2025-02-05 16:40:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:40,472 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-02-05 16:40:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:40,473 INFO L225 Difference]: With dead ends: 376 [2025-02-05 16:40:40,473 INFO L226 Difference]: Without dead ends: 371 [2025-02-05 16:40:40,475 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-02-05 16:40:40,475 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 678 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:40,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 980 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-05 16:40:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 247. [2025-02-05 16:40:40,480 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-02-05 16:40:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 300 transitions. [2025-02-05 16:40:40,481 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 300 transitions. Word has length 66 [2025-02-05 16:40:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 300 transitions. [2025-02-05 16:40:40,481 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-02-05 16:40:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 300 transitions. [2025-02-05 16:40:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:40,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:40,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:40,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:40:40,482 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-02-05 16:40:40,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:40,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1381566483, now seen corresponding path program 1 times [2025-02-05 16:40:40,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:40,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716114186] [2025-02-05 16:40:40,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:40,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:40,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:40,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:40,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:40,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716114186] [2025-02-05 16:40:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716114186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 16:40:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905722638] [2025-02-05 16:40:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:41,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 16:40:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:41,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 16:40:41,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:40:41,046 INFO L87 Difference]: Start difference. First operand 247 states and 300 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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-02-05 16:40:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:41,847 INFO L93 Difference]: Finished difference Result 567 states and 710 transitions. [2025-02-05 16:40:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:40:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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-02-05 16:40:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:41,849 INFO L225 Difference]: With dead ends: 567 [2025-02-05 16:40:41,849 INFO L226 Difference]: Without dead ends: 454 [2025-02-05 16:40:41,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:40:41,851 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1800 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:41,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 3384 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-05 16:40:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 223. [2025-02-05 16:40:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.2629107981220657) internal successors, (269), 222 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 269 transitions. [2025-02-05 16:40:41,855 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 269 transitions. Word has length 67 [2025-02-05 16:40:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 269 transitions. [2025-02-05 16:40:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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-02-05 16:40:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 269 transitions. [2025-02-05 16:40:41,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:41,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:41,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:40:41,856 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-02-05 16:40:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 141847688, now seen corresponding path program 1 times [2025-02-05 16:40:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:41,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316232372] [2025-02-05 16:40:41,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:41,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:41,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:41,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:41,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:41,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316232372] [2025-02-05 16:40:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316232372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:42,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:42,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:42,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017068197] [2025-02-05 16:40:42,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:42,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:42,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:42,187 INFO L87 Difference]: Start difference. First operand 223 states and 269 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:42,675 INFO L93 Difference]: Finished difference Result 560 states and 705 transitions. [2025-02-05 16:40:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:42,677 INFO L225 Difference]: With dead ends: 560 [2025-02-05 16:40:42,677 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 16:40:42,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:42,678 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 1569 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:42,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1650 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 16:40:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 222. [2025-02-05 16:40:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 212 states have (on average 1.259433962264151) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2025-02-05 16:40:42,682 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 67 [2025-02-05 16:40:42,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:42,682 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2025-02-05 16:40:42,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:42,682 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2025-02-05 16:40:42,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:42,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:42,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:42,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:40:42,683 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:42,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:42,683 INFO L85 PathProgramCache]: Analyzing trace with hash -122210774, now seen corresponding path program 1 times [2025-02-05 16:40:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574516663] [2025-02-05 16:40:42,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:42,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:42,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:42,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:42,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:43,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:43,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574516663] [2025-02-05 16:40:43,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574516663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:43,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:43,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-05 16:40:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329273409] [2025-02-05 16:40:43,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:43,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-05 16:40:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:43,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-05 16:40:43,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:40:43,461 INFO L87 Difference]: Start difference. First operand 222 states and 267 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-02-05 16:40:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:45,578 INFO L93 Difference]: Finished difference Result 665 states and 829 transitions. [2025-02-05 16:40:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 16:40:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-02-05 16:40:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:45,581 INFO L225 Difference]: With dead ends: 665 [2025-02-05 16:40:45,581 INFO L226 Difference]: Without dead ends: 659 [2025-02-05 16:40:45,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=1234, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 16:40:45,582 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1634 mSDsluCounter, 6921 mSDsCounter, 0 mSdLazyCounter, 3642 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 7518 SdHoareTripleChecker+Invalid, 3653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:45,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 7518 Invalid, 3653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3642 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 16:40:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-05 16:40:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 235. [2025-02-05 16:40:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 225 states have (on average 1.2622222222222221) internal successors, (284), 234 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2025-02-05 16:40:45,587 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 67 [2025-02-05 16:40:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2025-02-05 16:40:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-02-05 16:40:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2025-02-05 16:40:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:45,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:45,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:40:45,588 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-02-05 16:40:45,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash -385919704, now seen corresponding path program 1 times [2025-02-05 16:40:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:45,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25784084] [2025-02-05 16:40:45,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:45,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:45,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:45,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25784084] [2025-02-05 16:40:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25784084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55899124] [2025-02-05 16:40:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:45,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:45,991 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:46,683 INFO L93 Difference]: Finished difference Result 514 states and 638 transitions. [2025-02-05 16:40:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:46,684 INFO L225 Difference]: With dead ends: 514 [2025-02-05 16:40:46,685 INFO L226 Difference]: Without dead ends: 510 [2025-02-05 16:40:46,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:40:46,685 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1280 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:46,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2228 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:46,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-02-05 16:40:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 231. [2025-02-05 16:40:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 222 states have (on average 1.2612612612612613) internal successors, (280), 230 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 280 transitions. [2025-02-05 16:40:46,689 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 280 transitions. Word has length 67 [2025-02-05 16:40:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:46,689 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 280 transitions. [2025-02-05 16:40:46,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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-02-05 16:40:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 280 transitions. [2025-02-05 16:40:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:46,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:46,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:46,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:40:46,690 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1763550170, now seen corresponding path program 1 times [2025-02-05 16:40:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746448354] [2025-02-05 16:40:46,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:46,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:46,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:46,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:46,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746448354] [2025-02-05 16:40:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746448354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778418655] [2025-02-05 16:40:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:46,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:46,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:46,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:46,972 INFO L87 Difference]: Start difference. First operand 231 states and 280 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-02-05 16:40:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:47,391 INFO L93 Difference]: Finished difference Result 364 states and 468 transitions. [2025-02-05 16:40:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:47,392 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-02-05 16:40:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:47,393 INFO L225 Difference]: With dead ends: 364 [2025-02-05 16:40:47,393 INFO L226 Difference]: Without dead ends: 294 [2025-02-05 16:40:47,393 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-02-05 16:40:47,394 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 950 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:47,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1680 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-05 16:40:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 215. [2025-02-05 16:40:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.2548076923076923) internal successors, (261), 214 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2025-02-05 16:40:47,396 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 67 [2025-02-05 16:40:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:47,397 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2025-02-05 16:40:47,397 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-02-05 16:40:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2025-02-05 16:40:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:47,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:47,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:47,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:40:47,398 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:47,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash -33507831, now seen corresponding path program 1 times [2025-02-05 16:40:47,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:47,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867971808] [2025-02-05 16:40:47,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:47,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:47,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:47,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:47,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:47,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867971808] [2025-02-05 16:40:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867971808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:47,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101758989] [2025-02-05 16:40:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:47,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:47,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:47,653 INFO L87 Difference]: Start difference. First operand 215 states and 261 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-02-05 16:40:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:47,910 INFO L93 Difference]: Finished difference Result 294 states and 369 transitions. [2025-02-05 16:40:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:47,911 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-02-05 16:40:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:47,912 INFO L225 Difference]: With dead ends: 294 [2025-02-05 16:40:47,912 INFO L226 Difference]: Without dead ends: 259 [2025-02-05 16:40:47,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:40:47,912 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 974 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:47,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1160 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-05 16:40:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 174. [2025-02-05 16:40:47,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.2544378698224852) internal successors, (212), 173 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-02-05 16:40:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 212 transitions. [2025-02-05 16:40:47,916 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 212 transitions. Word has length 68 [2025-02-05 16:40:47,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:47,917 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 212 transitions. [2025-02-05 16:40:47,917 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-02-05 16:40:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 212 transitions. [2025-02-05 16:40:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:47,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:47,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:40:47,918 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:47,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 277228135, now seen corresponding path program 1 times [2025-02-05 16:40:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616796984] [2025-02-05 16:40:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:47,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:47,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:47,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616796984] [2025-02-05 16:40:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616796984] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:48,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:48,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279942720] [2025-02-05 16:40:48,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:48,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:48,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:48,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:48,220 INFO L87 Difference]: Start difference. First operand 174 states and 212 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-02-05 16:40:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:48,701 INFO L93 Difference]: Finished difference Result 459 states and 599 transitions. [2025-02-05 16:40:48,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:48,704 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-02-05 16:40:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:48,705 INFO L225 Difference]: With dead ends: 459 [2025-02-05 16:40:48,705 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 16:40:48,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:40:48,707 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1066 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:48,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 1443 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 16:40:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 170. [2025-02-05 16:40:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 166 states have (on average 1.2469879518072289) internal successors, (207), 169 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 207 transitions. [2025-02-05 16:40:48,716 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 207 transitions. Word has length 68 [2025-02-05 16:40:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:48,717 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 207 transitions. [2025-02-05 16:40:48,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 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-02-05 16:40:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 207 transitions. [2025-02-05 16:40:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:48,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:48,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:48,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:40:48,717 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash 540937065, now seen corresponding path program 1 times [2025-02-05 16:40:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182942609] [2025-02-05 16:40:48,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:48,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:48,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:48,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:48,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:49,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182942609] [2025-02-05 16:40:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182942609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:40:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340394217] [2025-02-05 16:40:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:49,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:40:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:49,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:40:49,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:40:49,411 INFO L87 Difference]: Start difference. First operand 170 states and 207 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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-02-05 16:40:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:50,595 INFO L93 Difference]: Finished difference Result 388 states and 509 transitions. [2025-02-05 16:40:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:40:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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-02-05 16:40:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:50,596 INFO L225 Difference]: With dead ends: 388 [2025-02-05 16:40:50,596 INFO L226 Difference]: Without dead ends: 323 [2025-02-05 16:40:50,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:40:50,597 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1068 mSDsluCounter, 3168 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 3513 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:50,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 3513 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:40:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-05 16:40:50,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 159. [2025-02-05 16:40:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 156 states have (on average 1.2371794871794872) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2025-02-05 16:40:50,599 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 68 [2025-02-05 16:40:50,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:50,600 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2025-02-05 16:40:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 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-02-05 16:40:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2025-02-05 16:40:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:40:50,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:50,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:50,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:40:50,604 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-02-05 16:40:50,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash -578655993, now seen corresponding path program 1 times [2025-02-05 16:40:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344499617] [2025-02-05 16:40:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:50,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:40:50,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:40:50,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:50,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:50,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344499617] [2025-02-05 16:40:50,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344499617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:50,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:50,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744968710] [2025-02-05 16:40:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:50,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:50,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:50,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:50,841 INFO L87 Difference]: Start difference. First operand 159 states and 193 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-02-05 16:40:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:51,336 INFO L93 Difference]: Finished difference Result 494 states and 666 transitions. [2025-02-05 16:40:51,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:40:51,337 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-02-05 16:40:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:51,338 INFO L225 Difference]: With dead ends: 494 [2025-02-05 16:40:51,338 INFO L226 Difference]: Without dead ends: 422 [2025-02-05 16:40:51,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:40:51,339 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2154 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:51,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 597 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-05 16:40:51,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 163. [2025-02-05 16:40:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 160 states have (on average 1.23125) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2025-02-05 16:40:51,341 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 68 [2025-02-05 16:40:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2025-02-05 16:40:51,342 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-02-05 16:40:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2025-02-05 16:40:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:51,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:51,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:51,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:40:51,342 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-02-05 16:40:51,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1414944311, now seen corresponding path program 1 times [2025-02-05 16:40:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133121481] [2025-02-05 16:40:51,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:51,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:51,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:51,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:51,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133121481] [2025-02-05 16:40:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133121481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605654946] [2025-02-05 16:40:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:51,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:51,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:51,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:51,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:51,473 INFO L87 Difference]: Start difference. First operand 163 states and 197 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-02-05 16:40:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:51,747 INFO L93 Difference]: Finished difference Result 259 states and 320 transitions. [2025-02-05 16:40:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:51,748 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-02-05 16:40:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:51,748 INFO L225 Difference]: With dead ends: 259 [2025-02-05 16:40:51,749 INFO L226 Difference]: Without dead ends: 252 [2025-02-05 16:40:51,749 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-02-05 16:40:51,749 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 784 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:51,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 489 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:51,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-05 16:40:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 163. [2025-02-05 16:40:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 160 states have (on average 1.225) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2025-02-05 16:40:51,751 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 69 [2025-02-05 16:40:51,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:51,751 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2025-02-05 16:40:51,751 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-02-05 16:40:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2025-02-05 16:40:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:51,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:51,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, 1] [2025-02-05 16:40:51,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:40:51,753 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-02-05 16:40:51,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1345860024, now seen corresponding path program 1 times [2025-02-05 16:40:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91180185] [2025-02-05 16:40:51,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:51,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:51,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:51,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:51,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91180185] [2025-02-05 16:40:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91180185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:51,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833500336] [2025-02-05 16:40:51,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:51,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:51,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:51,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:51,876 INFO L87 Difference]: Start difference. First operand 163 states and 196 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-02-05 16:40:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:52,144 INFO L93 Difference]: Finished difference Result 312 states and 400 transitions. [2025-02-05 16:40:52,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:52,145 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-02-05 16:40:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:52,146 INFO L225 Difference]: With dead ends: 312 [2025-02-05 16:40:52,146 INFO L226 Difference]: Without dead ends: 240 [2025-02-05 16:40:52,146 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-02-05 16:40:52,146 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 745 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 722 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:52,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-05 16:40:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 159. [2025-02-05 16:40:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 156 states have (on average 1.2243589743589745) internal successors, (191), 158 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 191 transitions. [2025-02-05 16:40:52,148 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 191 transitions. Word has length 69 [2025-02-05 16:40:52,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:52,148 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 191 transitions. [2025-02-05 16:40:52,148 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-02-05 16:40:52,148 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 191 transitions. [2025-02-05 16:40:52,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:40:52,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:52,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:52,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:40:52,149 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-02-05 16:40:52,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2059714215, now seen corresponding path program 1 times [2025-02-05 16:40:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:52,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102055482] [2025-02-05 16:40:52,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:52,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:52,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:40:52,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:40:52,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:52,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:52,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102055482] [2025-02-05 16:40:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102055482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:52,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:52,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396407642] [2025-02-05 16:40:52,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:52,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:52,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:52,485 INFO L87 Difference]: Start difference. First operand 159 states and 191 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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-02-05 16:40:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:52,945 INFO L93 Difference]: Finished difference Result 267 states and 336 transitions. [2025-02-05 16:40:52,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:52,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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-02-05 16:40:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:52,946 INFO L225 Difference]: With dead ends: 267 [2025-02-05 16:40:52,946 INFO L226 Difference]: Without dead ends: 261 [2025-02-05 16:40:52,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:40:52,947 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 732 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:52,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2066 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-05 16:40:52,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 165. [2025-02-05 16:40:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.228395061728395) internal successors, (199), 164 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2025-02-05 16:40:52,950 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 70 [2025-02-05 16:40:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2025-02-05 16:40:52,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 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-02-05 16:40:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2025-02-05 16:40:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:40:52,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:52,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:40:52,951 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:52,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:52,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1935775561, now seen corresponding path program 1 times [2025-02-05 16:40:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896564115] [2025-02-05 16:40:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:52,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:40:52,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:40:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896564115] [2025-02-05 16:40:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896564115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 16:40:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293802145] [2025-02-05 16:40:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:40:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:40:53,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:40:53,231 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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-02-05 16:40:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,406 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2025-02-05 16:40:53,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 16:40:53,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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-02-05 16:40:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,408 INFO L225 Difference]: With dead ends: 226 [2025-02-05 16:40:53,408 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 16:40:53,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:40:53,408 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 820 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 628 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 16:40:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2025-02-05 16:40:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 140 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2025-02-05 16:40:53,421 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 71 [2025-02-05 16:40:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,421 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2025-02-05 16:40:53,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 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-02-05 16:40:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2025-02-05 16:40:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:40:53,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:40:53,425 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -408719691, now seen corresponding path program 1 times [2025-02-05 16:40:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68947640] [2025-02-05 16:40:53,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:40:53,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:40:53,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68947640] [2025-02-05 16:40:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68947640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156599518] [2025-02-05 16:40:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:40:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:53,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:40:53,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:40:53,718 INFO L87 Difference]: Start difference. First operand 141 states and 173 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-02-05 16:40:53,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:53,973 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2025-02-05 16:40:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:53,973 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-02-05 16:40:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:53,974 INFO L225 Difference]: With dead ends: 202 [2025-02-05 16:40:53,974 INFO L226 Difference]: Without dead ends: 196 [2025-02-05 16:40:53,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:40:53,975 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 544 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:53,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1055 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:53,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-05 16:40:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2025-02-05 16:40:53,976 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-02-05 16:40:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 159 transitions. [2025-02-05 16:40:53,976 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 159 transitions. Word has length 71 [2025-02-05 16:40:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,977 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 159 transitions. [2025-02-05 16:40:53,977 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-02-05 16:40:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2025-02-05 16:40:53,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:40:53,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:53,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:40:53,978 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:53,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1709352252, now seen corresponding path program 1 times [2025-02-05 16:40:53,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129445419] [2025-02-05 16:40:53,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:40:53,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:40:53,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129445419] [2025-02-05 16:40:54,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129445419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766845077] [2025-02-05 16:40:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,039 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-02-05 16:40:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,126 INFO L93 Difference]: Finished difference Result 561 states and 791 transitions. [2025-02-05 16:40:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:54,126 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-02-05 16:40:54,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,127 INFO L225 Difference]: With dead ends: 561 [2025-02-05 16:40:54,127 INFO L226 Difference]: Without dead ends: 507 [2025-02-05 16:40:54,128 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-02-05 16:40:54,128 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 766 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1319 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:54,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-05 16:40:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 181. [2025-02-05 16:40:54,131 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-02-05 16:40:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2025-02-05 16:40:54,131 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 93 [2025-02-05 16:40:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,131 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2025-02-05 16:40:54,131 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-02-05 16:40:54,132 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2025-02-05 16:40:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:40:54,132 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:54,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash -747684288, now seen corresponding path program 1 times [2025-02-05 16:40:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349881358] [2025-02-05 16:40:54,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349881358] [2025-02-05 16:40:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349881358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791392782] [2025-02-05 16:40:54,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,199 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-02-05 16:40:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,258 INFO L93 Difference]: Finished difference Result 659 states and 932 transitions. [2025-02-05 16:40:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,258 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-02-05 16:40:54,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,259 INFO L225 Difference]: With dead ends: 659 [2025-02-05 16:40:54,259 INFO L226 Difference]: Without dead ends: 553 [2025-02-05 16:40:54,260 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-02-05 16:40:54,260 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 573 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 814 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-05 16:40:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 285. [2025-02-05 16:40:54,263 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-02-05 16:40:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2025-02-05 16:40:54,264 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 95 [2025-02-05 16:40:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,264 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2025-02-05 16:40:54,264 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-02-05 16:40:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2025-02-05 16:40:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:40:54,265 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-02-05 16:40:54,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash -884037152, now seen corresponding path program 1 times [2025-02-05 16:40:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337348617] [2025-02-05 16:40:54,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337348617] [2025-02-05 16:40:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337348617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281166360] [2025-02-05 16:40:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,331 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-02-05 16:40:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,390 INFO L93 Difference]: Finished difference Result 763 states and 1085 transitions. [2025-02-05 16:40:54,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,390 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-02-05 16:40:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,391 INFO L225 Difference]: With dead ends: 763 [2025-02-05 16:40:54,391 INFO L226 Difference]: Without dead ends: 657 [2025-02-05 16:40:54,392 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-02-05 16:40:54,392 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 573 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 764 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-05 16:40:54,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 441. [2025-02-05 16:40:54,398 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-02-05 16:40:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 617 transitions. [2025-02-05 16:40:54,398 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 617 transitions. Word has length 95 [2025-02-05 16:40:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,399 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 617 transitions. [2025-02-05 16:40:54,399 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-02-05 16:40:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 617 transitions. [2025-02-05 16:40:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:40:54,400 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-02-05 16:40:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1039459712, now seen corresponding path program 1 times [2025-02-05 16:40:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491473212] [2025-02-05 16:40:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491473212] [2025-02-05 16:40:54,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491473212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333299523] [2025-02-05 16:40:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,476 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-02-05 16:40:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,543 INFO L93 Difference]: Finished difference Result 867 states and 1238 transitions. [2025-02-05 16:40:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,544 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-02-05 16:40:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,545 INFO L225 Difference]: With dead ends: 867 [2025-02-05 16:40:54,545 INFO L226 Difference]: Without dead ends: 761 [2025-02-05 16:40:54,546 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-02-05 16:40:54,546 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 617 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 751 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-02-05 16:40:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 545. [2025-02-05 16:40:54,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.4154411764705883) internal successors, (770), 544 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 770 transitions. [2025-02-05 16:40:54,551 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 770 transitions. Word has length 95 [2025-02-05 16:40:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,552 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 770 transitions. [2025-02-05 16:40:54,552 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-02-05 16:40:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 770 transitions. [2025-02-05 16:40:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:40:54,552 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-02-05 16:40:54,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -769620734, now seen corresponding path program 1 times [2025-02-05 16:40:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637081289] [2025-02-05 16:40:54,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637081289] [2025-02-05 16:40:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637081289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051569008] [2025-02-05 16:40:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,655 INFO L87 Difference]: Start difference. First operand 545 states and 770 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-02-05 16:40:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,718 INFO L93 Difference]: Finished difference Result 1017 states and 1461 transitions. [2025-02-05 16:40:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,718 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-02-05 16:40:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,719 INFO L225 Difference]: With dead ends: 1017 [2025-02-05 16:40:54,720 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 16:40:54,720 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-02-05 16:40:54,720 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-02-05 16:40:54,720 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-02-05 16:40:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 16:40:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-02-05 16:40:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 1.40625) internal successors, (765), 544 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 765 transitions. [2025-02-05 16:40:54,725 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 765 transitions. Word has length 95 [2025-02-05 16:40:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 765 transitions. [2025-02-05 16:40:54,725 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-02-05 16:40:54,725 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 765 transitions. [2025-02-05 16:40:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:40:54,726 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-02-05 16:40:54,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash -805638053, now seen corresponding path program 1 times [2025-02-05 16:40:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224380557] [2025-02-05 16:40:54,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224380557] [2025-02-05 16:40:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224380557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:54,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663901737] [2025-02-05 16:40:54,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:54,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:54,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:54,757 INFO L87 Difference]: Start difference. First operand 545 states and 765 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-02-05 16:40:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,774 INFO L93 Difference]: Finished difference Result 1427 states and 2038 transitions. [2025-02-05 16:40:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:54,774 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-02-05 16:40:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,776 INFO L225 Difference]: With dead ends: 1427 [2025-02-05 16:40:54,776 INFO L226 Difference]: Without dead ends: 957 [2025-02-05 16:40:54,777 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-02-05 16:40:54,777 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-02-05 16:40:54,777 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-02-05 16:40:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-02-05 16:40:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 955. [2025-02-05 16:40:54,784 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-02-05 16:40:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1334 transitions. [2025-02-05 16:40:54,785 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1334 transitions. Word has length 95 [2025-02-05 16:40:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,785 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1334 transitions. [2025-02-05 16:40:54,786 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-02-05 16:40:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1334 transitions. [2025-02-05 16:40:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:54,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:40:54,786 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-02-05 16:40:54,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1085673184, now seen corresponding path program 1 times [2025-02-05 16:40:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47623259] [2025-02-05 16:40:54,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:54,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:54,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47623259] [2025-02-05 16:40:54,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47623259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567666344] [2025-02-05 16:40:54,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:54,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:54,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:54,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:54,852 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-02-05 16:40:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,913 INFO L93 Difference]: Finished difference Result 1745 states and 2459 transitions. [2025-02-05 16:40:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:54,914 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-02-05 16:40:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:54,916 INFO L225 Difference]: With dead ends: 1745 [2025-02-05 16:40:54,916 INFO L226 Difference]: Without dead ends: 1548 [2025-02-05 16:40:54,917 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-02-05 16:40:54,917 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 583 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:54,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 795 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-02-05 16:40:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1150. [2025-02-05 16:40:54,937 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-02-05 16:40:54,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1612 transitions. [2025-02-05 16:40:54,938 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1612 transitions. Word has length 95 [2025-02-05 16:40:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:54,938 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1612 transitions. [2025-02-05 16:40:54,938 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-02-05 16:40:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1612 transitions. [2025-02-05 16:40:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:40:54,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:54,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:54,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:40:54,939 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-02-05 16:40:54,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1941145606, now seen corresponding path program 1 times [2025-02-05 16:40:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:54,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581127474] [2025-02-05 16:40:54,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:54,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:40:54,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:40:54,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,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-02-05 16:40:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581127474] [2025-02-05 16:40:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581127474] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189098374] [2025-02-05 16:40:55,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,027 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-02-05 16:40:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,048 INFO L93 Difference]: Finished difference Result 2882 states and 4059 transitions. [2025-02-05 16:40:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,049 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-02-05 16:40:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,056 INFO L225 Difference]: With dead ends: 2882 [2025-02-05 16:40:55,059 INFO L226 Difference]: Without dead ends: 1807 [2025-02-05 16:40:55,060 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-02-05 16:40:55,061 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-02-05 16:40:55,061 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-02-05 16:40:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1807 states. [2025-02-05 16:40:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1807 to 1717. [2025-02-05 16:40:55,087 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-02-05 16:40:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2394 transitions. [2025-02-05 16:40:55,088 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2394 transitions. Word has length 96 [2025-02-05 16:40:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,088 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2394 transitions. [2025-02-05 16:40:55,089 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-02-05 16:40:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2394 transitions. [2025-02-05 16:40:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:40:55,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:40:55,093 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-02-05 16:40:55,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1630603392, now seen corresponding path program 1 times [2025-02-05 16:40:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123036723] [2025-02-05 16:40:55,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:40:55,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:40:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123036723] [2025-02-05 16:40:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123036723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360758897] [2025-02-05 16:40:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,160 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-02-05 16:40:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,177 INFO L93 Difference]: Finished difference Result 4869 states and 6791 transitions. [2025-02-05 16:40:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,177 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-02-05 16:40:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,183 INFO L225 Difference]: With dead ends: 4869 [2025-02-05 16:40:55,183 INFO L226 Difference]: Without dead ends: 3227 [2025-02-05 16:40:55,185 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-02-05 16:40:55,185 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-02-05 16:40:55,185 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-02-05 16:40:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2025-02-05 16:40:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3093. [2025-02-05 16:40:55,206 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-02-05 16:40:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 4278 transitions. [2025-02-05 16:40:55,209 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 4278 transitions. Word has length 97 [2025-02-05 16:40:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,209 INFO L471 AbstractCegarLoop]: Abstraction has 3093 states and 4278 transitions. [2025-02-05 16:40:55,209 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-02-05 16:40:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 4278 transitions. [2025-02-05 16:40:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:40:55,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:40:55,210 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-02-05 16:40:55,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -251076935, now seen corresponding path program 1 times [2025-02-05 16:40:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26977468] [2025-02-05 16:40:55,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:40:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:40:55,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26977468] [2025-02-05 16:40:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26977468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167942834] [2025-02-05 16:40:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,270 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-02-05 16:40:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,293 INFO L93 Difference]: Finished difference Result 8865 states and 12212 transitions. [2025-02-05 16:40:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,293 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-02-05 16:40:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,308 INFO L225 Difference]: With dead ends: 8865 [2025-02-05 16:40:55,311 INFO L226 Difference]: Without dead ends: 5847 [2025-02-05 16:40:55,314 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-02-05 16:40:55,315 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-02-05 16:40:55,316 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-02-05 16:40:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2025-02-05 16:40:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5581. [2025-02-05 16:40:55,376 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-02-05 16:40:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5581 states to 5581 states and 7617 transitions. [2025-02-05 16:40:55,384 INFO L78 Accepts]: Start accepts. Automaton has 5581 states and 7617 transitions. Word has length 98 [2025-02-05 16:40:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 5581 states and 7617 transitions. [2025-02-05 16:40:55,384 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-02-05 16:40:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5581 states and 7617 transitions. [2025-02-05 16:40:55,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:40:55,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:40:55,385 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-02-05 16:40:55,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 900515987, now seen corresponding path program 1 times [2025-02-05 16:40:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844820959] [2025-02-05 16:40:55,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:40:55,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:40:55,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844820959] [2025-02-05 16:40:55,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844820959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402855947] [2025-02-05 16:40:55,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,469 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-02-05 16:40:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,505 INFO L93 Difference]: Finished difference Result 16065 states and 21767 transitions. [2025-02-05 16:40:55,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,506 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-02-05 16:40:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,522 INFO L225 Difference]: With dead ends: 16065 [2025-02-05 16:40:55,522 INFO L226 Difference]: Without dead ends: 10559 [2025-02-05 16:40:55,527 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-02-05 16:40:55,528 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-02-05 16:40:55,528 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-02-05 16:40:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-02-05 16:40:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 10029. [2025-02-05 16:40:55,601 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-02-05 16:40:55,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10029 states to 10029 states and 13437 transitions. [2025-02-05 16:40:55,610 INFO L78 Accepts]: Start accepts. Automaton has 10029 states and 13437 transitions. Word has length 99 [2025-02-05 16:40:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,611 INFO L471 AbstractCegarLoop]: Abstraction has 10029 states and 13437 transitions. [2025-02-05 16:40:55,611 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-02-05 16:40:55,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10029 states and 13437 transitions. [2025-02-05 16:40:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:40:55,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:40:55,611 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-02-05 16:40:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash -478706580, now seen corresponding path program 1 times [2025-02-05 16:40:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401212763] [2025-02-05 16:40:55,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:40:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:40:55,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401212763] [2025-02-05 16:40:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401212763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167218662] [2025-02-05 16:40:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:55,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:55,758 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-02-05 16:40:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,793 INFO L93 Difference]: Finished difference Result 10271 states and 13758 transitions. [2025-02-05 16:40:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:55,793 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-02-05 16:40:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,806 INFO L225 Difference]: With dead ends: 10271 [2025-02-05 16:40:55,807 INFO L226 Difference]: Without dead ends: 10269 [2025-02-05 16:40:55,808 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-02-05 16:40:55,808 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-02-05 16:40:55,809 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-02-05 16:40:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10269 states. [2025-02-05 16:40:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10269 to 10269. [2025-02-05 16:40:55,879 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-02-05 16:40:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10269 states to 10269 states and 13581 transitions. [2025-02-05 16:40:55,889 INFO L78 Accepts]: Start accepts. Automaton has 10269 states and 13581 transitions. Word has length 100 [2025-02-05 16:40:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:55,889 INFO L471 AbstractCegarLoop]: Abstraction has 10269 states and 13581 transitions. [2025-02-05 16:40:55,890 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-02-05 16:40:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 10269 states and 13581 transitions. [2025-02-05 16:40:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:40:55,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:55,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:40:55,890 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-02-05 16:40:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1477032781, now seen corresponding path program 1 times [2025-02-05 16:40:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:55,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352791079] [2025-02-05 16:40:55,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:55,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:40:55,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:40:55,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:55,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:55,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352791079] [2025-02-05 16:40:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352791079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:55,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849108079] [2025-02-05 16:40:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:55,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:55,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:55,924 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-02-05 16:40:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:55,963 INFO L93 Difference]: Finished difference Result 20785 states and 27511 transitions. [2025-02-05 16:40:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:55,964 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-02-05 16:40:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,977 INFO L225 Difference]: With dead ends: 20785 [2025-02-05 16:40:55,978 INFO L226 Difference]: Without dead ends: 10591 [2025-02-05 16:40:55,987 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-02-05 16:40:55,987 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-02-05 16:40:55,988 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-02-05 16:40:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2025-02-05 16:40:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10589. [2025-02-05 16:40:56,064 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-02-05 16:40:56,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10589 states to 10589 states and 13825 transitions. [2025-02-05 16:40:56,074 INFO L78 Accepts]: Start accepts. Automaton has 10589 states and 13825 transitions. Word has length 100 [2025-02-05 16:40:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:56,074 INFO L471 AbstractCegarLoop]: Abstraction has 10589 states and 13825 transitions. [2025-02-05 16:40:56,075 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-02-05 16:40:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 10589 states and 13825 transitions. [2025-02-05 16:40:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:40:56,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:56,077 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-02-05 16:40:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:40:56,077 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-02-05 16:40:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash 895650102, now seen corresponding path program 1 times [2025-02-05 16:40:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22666265] [2025-02-05 16:40:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:56,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:56,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:56,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:56,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22666265] [2025-02-05 16:40:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22666265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:56,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772890567] [2025-02-05 16:40:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:56,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:56,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:56,520 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-02-05 16:40:56,521 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-02-05 16:40:56,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:56,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:56,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:56,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:57,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772890567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:58,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2025-02-05 16:40:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872461472] [2025-02-05 16:40:58,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:40:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:58,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:40:58,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:40:58,691 INFO L87 Difference]: Start difference. First operand 10589 states and 13825 transitions. Second operand has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 29 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:05,656 INFO L93 Difference]: Finished difference Result 91528 states and 119238 transitions. [2025-02-05 16:41:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-02-05 16:41:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 29 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have 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-02-05 16:41:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:05,929 INFO L225 Difference]: With dead ends: 91528 [2025-02-05 16:41:05,930 INFO L226 Difference]: Without dead ends: 81014 [2025-02-05 16:41:05,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10509 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4585, Invalid=27277, Unknown=0, NotChecked=0, Total=31862 [2025-02-05 16:41:05,985 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 3128 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 3963 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 4027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:05,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3128 Valid, 3154 Invalid, 4027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3963 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:41:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81014 states. [2025-02-05 16:41:06,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81014 to 53369. [2025-02-05 16:41:07,041 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-02-05 16:41:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53369 states to 53369 states and 69229 transitions. [2025-02-05 16:41:07,114 INFO L78 Accepts]: Start accepts. Automaton has 53369 states and 69229 transitions. Word has length 127 [2025-02-05 16:41:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 53369 states and 69229 transitions. [2025-02-05 16:41:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.333333333333334) internal successors, (340), 29 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 53369 states and 69229 transitions. [2025-02-05 16:41:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:41:07,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:07,125 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-02-05 16:41:07,135 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-02-05 16:41:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:07,327 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-02-05 16:41:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 322156083, now seen corresponding path program 1 times [2025-02-05 16:41:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847828310] [2025-02-05 16:41:07,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:07,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:07,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:41:07,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:41:07,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:07,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:07,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847828310] [2025-02-05 16:41:07,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847828310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:07,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268655228] [2025-02-05 16:41:07,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:07,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:07,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:07,826 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-02-05 16:41:07,827 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-02-05 16:41:07,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:41:08,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:41:08,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:08,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:08,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 16:41:08,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:08,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268655228] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:09,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:09,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2025-02-05 16:41:09,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402077978] [2025-02-05 16:41:09,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:41:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:09,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:41:09,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:41:09,159 INFO L87 Difference]: Start difference. First operand 53369 states and 69229 transitions. Second operand has 27 states, 27 states have (on average 12.62962962962963) internal successors, (341), 27 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:15,748 INFO L93 Difference]: Finished difference Result 276809 states and 359272 transitions. [2025-02-05 16:41:15,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2025-02-05 16:41:15,749 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.62962962962963) internal successors, (341), 27 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have 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-02-05 16:41:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:16,198 INFO L225 Difference]: With dead ends: 276809 [2025-02-05 16:41:16,201 INFO L226 Difference]: Without dead ends: 223578 [2025-02-05 16:41:16,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14363 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5128, Invalid=32314, Unknown=0, NotChecked=0, Total=37442 [2025-02-05 16:41:16,279 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 4421 mSDsluCounter, 3082 mSDsCounter, 0 mSdLazyCounter, 3318 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 3239 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:16,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 3239 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3318 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:41:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223578 states. [2025-02-05 16:41:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223578 to 132296. [2025-02-05 16:41:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132296 states, 132295 states have (on average 1.2901772553762425) internal successors, (170684), 132295 states have internal predecessors, (170684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132296 states to 132296 states and 170684 transitions. [2025-02-05 16:41:18,451 INFO L78 Accepts]: Start accepts. Automaton has 132296 states and 170684 transitions. Word has length 128 [2025-02-05 16:41:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:18,451 INFO L471 AbstractCegarLoop]: Abstraction has 132296 states and 170684 transitions. [2025-02-05 16:41:18,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.62962962962963) internal successors, (341), 27 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:18,452 INFO L276 IsEmpty]: Start isEmpty. Operand 132296 states and 170684 transitions. [2025-02-05 16:41:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:41:18,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:18,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:18,487 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-02-05 16:41:18,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:18,675 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-02-05 16:41:18,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 88785878, now seen corresponding path program 1 times [2025-02-05 16:41:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297565811] [2025-02-05 16:41:18,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:18,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:41:18,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:41:18,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297565811] [2025-02-05 16:41:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297565811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183161901] [2025-02-05 16:41:18,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:18,996 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-02-05 16:41:18,998 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-02-05 16:41:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:41:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:41:19,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:19,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:19,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:41:19,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:20,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183161901] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:20,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 16:41:20,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961935915] [2025-02-05 16:41:20,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:41:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:20,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:41:20,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:41:20,656 INFO L87 Difference]: Start difference. First operand 132296 states and 170684 transitions. Second operand has 25 states, 25 states have (on average 13.8) internal successors, (345), 25 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:25,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:25,031 INFO L93 Difference]: Finished difference Result 425310 states and 551973 transitions. [2025-02-05 16:41:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-02-05 16:41:25,031 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 13.8) internal successors, (345), 25 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have 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-02-05 16:41:25,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:26,124 INFO L225 Difference]: With dead ends: 425310 [2025-02-05 16:41:26,124 INFO L226 Difference]: Without dead ends: 400228 [2025-02-05 16:41:26,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5693 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2624, Invalid=14146, Unknown=0, NotChecked=0, Total=16770 [2025-02-05 16:41:26,207 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4566 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4566 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:26,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4566 Valid, 1783 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:41:26,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400228 states. [2025-02-05 16:41:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400228 to 202514. [2025-02-05 16:41:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202514 states, 202513 states have (on average 1.2886234463960338) internal successors, (260963), 202513 states have internal predecessors, (260963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202514 states to 202514 states and 260963 transitions. [2025-02-05 16:41:29,971 INFO L78 Accepts]: Start accepts. Automaton has 202514 states and 260963 transitions. Word has length 129 [2025-02-05 16:41:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:29,971 INFO L471 AbstractCegarLoop]: Abstraction has 202514 states and 260963 transitions. [2025-02-05 16:41:29,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.8) internal successors, (345), 25 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 202514 states and 260963 transitions. [2025-02-05 16:41:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:41:29,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:29,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:29,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:41:30,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:30,192 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-02-05 16:41:30,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:30,193 INFO L85 PathProgramCache]: Analyzing trace with hash 476387083, now seen corresponding path program 1 times [2025-02-05 16:41:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:30,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603532156] [2025-02-05 16:41:30,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:30,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:30,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:41:30,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:41:30,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:30,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603532156] [2025-02-05 16:41:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603532156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:41:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72955117] [2025-02-05 16:41:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:41:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:30,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:41:30,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:41:30,256 INFO L87 Difference]: Start difference. First operand 202514 states and 260963 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:32,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:32,073 INFO L93 Difference]: Finished difference Result 397978 states and 512790 transitions. [2025-02-05 16:41:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:41:32,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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-02-05 16:41:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:32,262 INFO L225 Difference]: With dead ends: 397978 [2025-02-05 16:41:32,262 INFO L226 Difference]: Without dead ends: 195616 [2025-02-05 16:41:32,302 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-02-05 16:41:32,305 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:32,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 313 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:41:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195616 states. [2025-02-05 16:41:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195616 to 181094. [2025-02-05 16:41:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181094 states, 181093 states have (on average 1.2806237678982622) internal successors, (231912), 181093 states have internal predecessors, (231912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181094 states to 181094 states and 231912 transitions. [2025-02-05 16:41:34,552 INFO L78 Accepts]: Start accepts. Automaton has 181094 states and 231912 transitions. Word has length 129 [2025-02-05 16:41:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:34,552 INFO L471 AbstractCegarLoop]: Abstraction has 181094 states and 231912 transitions. [2025-02-05 16:41:34,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 181094 states and 231912 transitions. [2025-02-05 16:41:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:41:35,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:35,170 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-02-05 16:41:35,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-05 16:41:35,170 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-02-05 16:41:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 252355083, now seen corresponding path program 1 times [2025-02-05 16:41:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679136058] [2025-02-05 16:41:35,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:35,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:41:35,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:41:35,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:35,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 16:41:35,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679136058] [2025-02-05 16:41:35,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679136058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:41:35,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:41:35,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:41:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649864893] [2025-02-05 16:41:35,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:41:35,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:41:35,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:35,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:41:35,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:41:35,344 INFO L87 Difference]: Start difference. First operand 181094 states and 231912 transitions. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:37,205 INFO L93 Difference]: Finished difference Result 547976 states and 700408 transitions. [2025-02-05 16:41:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:41:37,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have 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-02-05 16:41:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:37,618 INFO L225 Difference]: With dead ends: 547976 [2025-02-05 16:41:37,618 INFO L226 Difference]: Without dead ends: 367010 [2025-02-05 16:41:37,707 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-02-05 16:41:37,708 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 562 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:37,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 585 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:41:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367010 states. [2025-02-05 16:41:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367010 to 181094. [2025-02-05 16:41:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181094 states, 181093 states have (on average 1.2806016797998818) internal successors, (231908), 181093 states have internal predecessors, (231908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181094 states to 181094 states and 231908 transitions. [2025-02-05 16:41:41,174 INFO L78 Accepts]: Start accepts. Automaton has 181094 states and 231908 transitions. Word has length 129 [2025-02-05 16:41:41,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:41:41,174 INFO L471 AbstractCegarLoop]: Abstraction has 181094 states and 231908 transitions. [2025-02-05 16:41:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 8 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:41:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 181094 states and 231908 transitions. [2025-02-05 16:41:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:41:41,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:41:41,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:41:41,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-05 16:41:41,184 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:41:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:41:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1791123155, now seen corresponding path program 1 times [2025-02-05 16:41:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:41:41,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946814215] [2025-02-05 16:41:41,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:41:41,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:41:41,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:41:41,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:41,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:41:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946814215] [2025-02-05 16:41:41,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946814215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:41:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769312430] [2025-02-05 16:41:41,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:41:41,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:41:41,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:41:41,484 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:41:41,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:41:41,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:41:41,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:41:41,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:41:41,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:41:41,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:41:41,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:41:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:42,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:41:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:41:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769312430] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:41:43,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:41:43,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 32 [2025-02-05 16:41:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881662547] [2025-02-05 16:41:43,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:41:43,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 16:41:43,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:41:43,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 16:41:43,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 16:41:43,813 INFO L87 Difference]: Start difference. First operand 181094 states and 231908 transitions. Second operand has 33 states, 33 states have (on average 11.303030303030303) internal successors, (373), 32 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)