./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.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.1.ufo.UNBOUNDED.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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:39:57,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:39:57,462 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:39:57,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:39:57,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:39:57,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:39:57,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:39:57,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:39:57,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:39:57,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:39:57,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:39:57,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:39:57,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:39:57,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:39:57,489 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:39:57,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:39:57,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:39:57,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:39:57,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:39:57,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:39:57,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:39:57,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:57,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:39:57,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:39:57,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:39:57,492 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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2025-02-05 16:39:57,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:39:57,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:39:57,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:39:57,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:39:57,716 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:39:57,717 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:39:58,809 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70335b83/6571844f17814eb2a075876968da287f/FLAGebe0baec2 [2025-02-05 16:39:59,144 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:39:59,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:39:59,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70335b83/6571844f17814eb2a075876968da287f/FLAGebe0baec2 [2025-02-05 16:39:59,376 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d70335b83/6571844f17814eb2a075876968da287f [2025-02-05 16:39:59,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:39:59,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:39:59,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:59,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:39:59,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:39:59,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d2a463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59, skipping insertion in model container [2025-02-05 16:39:59,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:39:59,592 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-02-05 16:39:59,618 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-02-05 16:39:59,626 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-02-05 16:39:59,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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-02-05 16:39:59,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-02-05 16:39:59,651 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-02-05 16:39:59,658 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-02-05 16:39:59,671 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-02-05 16:39:59,675 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-02-05 16:39:59,679 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-02-05 16:39:59,688 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-02-05 16:39:59,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:59,754 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:39:59,789 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-02-05 16:39:59,794 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-02-05 16:39:59,796 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-02-05 16:39:59,797 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-02-05 16:39:59,800 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-02-05 16:39:59,804 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-02-05 16:39:59,806 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-02-05 16:39:59,812 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-02-05 16:39:59,814 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-02-05 16:39:59,816 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-02-05 16:39:59,821 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-02-05 16:39:59,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:59,870 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:39:59,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59 WrapperNode [2025-02-05 16:39:59,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:59,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:59,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:39:59,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:39:59,876 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:39:59" (1/1) ... [2025-02-05 16:39:59,886 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:39:59" (1/1) ... [2025-02-05 16:39:59,927 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1924 [2025-02-05 16:39:59,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:59,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:39:59,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:39:59,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:39:59,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,938 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,964 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:39:59,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:39:59,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:40:00,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:40:00,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:40:00,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:40:00,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:40:00,013 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:40:00,014 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (1/1) ... [2025-02-05 16:40:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:40:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:00,038 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:00,041 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:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:40:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:40:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:40:00,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:40:00,184 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:40:00,186 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:40:01,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~check__tmp~15#1; [2025-02-05 16:40:01,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node4__m4~8#1; [2025-02-05 16:40:01,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-05 16:40:01,225 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1592: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~node4__m4~1#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1329: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~node3__m3~3#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1; [2025-02-05 16:40:01,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2__m2~1#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2260: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2327: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: havoc main_~node3__m3~4#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:40:01,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~node3__m3~5#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1378: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: 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:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node4__m4~3#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2106: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc main_~node4__m4~4#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node3__m3~1#1; [2025-02-05 16:40:01,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~check__tmp~9#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1116: havoc main_~node4__m4~5#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1150: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2902: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node3__m3~2#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3003: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: havoc main_~node4__m4~6#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-05 16:40:01,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1486: havoc main_~check__tmp~13#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420: havoc main_~node4__m4~7#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1454: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-05 16:40:01,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257: havoc main_~node2__m2~3#1; [2025-02-05 16:40:01,281 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2025-02-05 16:40:01,282 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:40:01,301 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:40:01,301 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:40:01,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:01 BoogieIcfgContainer [2025-02-05 16:40:01,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:40:01,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:40:01,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:40:01,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:40:01,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:39:59" (1/3) ... [2025-02-05 16:40:01,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c25a690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:01, skipping insertion in model container [2025-02-05 16:40:01,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:59" (2/3) ... [2025-02-05 16:40:01,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c25a690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:40:01, skipping insertion in model container [2025-02-05 16:40:01,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:40:01" (3/3) ... [2025-02-05 16:40:01,308 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:40:01,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:40:01,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 357 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-05 16:40:01,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:40:01,376 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;@564f45ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:40:01,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-05 16:40:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 0 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:01,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:40:01,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:01,387 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] [2025-02-05 16:40:01,387 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:01,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1636711810, now seen corresponding path program 1 times [2025-02-05 16:40:01,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:01,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980317703] [2025-02-05 16:40:01,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:01,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:01,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:40:01,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:40:01,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,825 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:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980317703] [2025-02-05 16:40:01,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980317703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:01,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:01,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:01,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887993380] [2025-02-05 16:40:01,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:01,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:01,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:01,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:01,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:01,852 INFO L87 Difference]: Start difference. First operand has 357 states, 345 states have (on average 1.8376811594202898) internal successors, (634), 356 states have internal predecessors, (634), 0 states have call successors, (0), 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.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,165 INFO L93 Difference]: Finished difference Result 569 states and 972 transitions. [2025-02-05 16:40:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-02-05 16:40:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,177 INFO L225 Difference]: With dead ends: 569 [2025-02-05 16:40:02,178 INFO L226 Difference]: Without dead ends: 314 [2025-02-05 16:40:02,181 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:02,183 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1498 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:02,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 403 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-02-05 16:40:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-02-05 16:40:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 303 states have (on average 1.2805280528052805) internal successors, (388), 313 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:02,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 388 transitions. [2025-02-05 16:40:02,222 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 388 transitions. Word has length 58 [2025-02-05 16:40:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,223 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 388 transitions. [2025-02-05 16:40:02,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 388 transitions. [2025-02-05 16:40:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:40:02,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,227 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:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:40:02,228 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:02,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1967361935, now seen corresponding path program 1 times [2025-02-05 16:40:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893149274] [2025-02-05 16:40:02,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:40:02,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:40:02,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,401 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:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893149274] [2025-02-05 16:40:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893149274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:02,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189854914] [2025-02-05 16:40:02,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:02,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:02,403 INFO L87 Difference]: Start difference. First operand 314 states and 388 transitions. 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:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,634 INFO L93 Difference]: Finished difference Result 651 states and 837 transitions. [2025-02-05 16:40:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:02,634 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:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,636 INFO L225 Difference]: With dead ends: 651 [2025-02-05 16:40:02,636 INFO L226 Difference]: Without dead ends: 407 [2025-02-05 16:40:02,636 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:02,637 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1345 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:02,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 315 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-05 16:40:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 365. [2025-02-05 16:40:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 354 states have (on average 1.3644067796610169) internal successors, (483), 364 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 483 transitions. [2025-02-05 16:40:02,658 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 483 transitions. Word has length 59 [2025-02-05 16:40:02,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,658 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 483 transitions. [2025-02-05 16:40:02,659 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:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 483 transitions. [2025-02-05 16:40:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:40:02,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,665 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:02,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:40:02,665 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:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1090760522, now seen corresponding path program 1 times [2025-02-05 16:40:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535060158] [2025-02-05 16:40:02,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:40:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:40:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:02,798 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:02,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:02,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535060158] [2025-02-05 16:40:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535060158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:02,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143036344] [2025-02-05 16:40:02,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:02,799 INFO L87 Difference]: Start difference. First operand 365 states and 483 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:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:02,933 INFO L93 Difference]: Finished difference Result 660 states and 893 transitions. [2025-02-05 16:40:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:02,933 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:02,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:02,935 INFO L225 Difference]: With dead ends: 660 [2025-02-05 16:40:02,935 INFO L226 Difference]: Without dead ends: 346 [2025-02-05 16:40:02,936 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:02,937 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 914 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 200 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:02,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 200 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:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-02-05 16:40:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2025-02-05 16:40:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 335 states have (on average 1.373134328358209) internal successors, (460), 345 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 460 transitions. [2025-02-05 16:40:02,949 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 460 transitions. Word has length 60 [2025-02-05 16:40:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:02,950 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 460 transitions. [2025-02-05 16:40:02,950 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:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 460 transitions. [2025-02-05 16:40:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:40:02,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:02,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:40:02,951 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:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1934057823, now seen corresponding path program 1 times [2025-02-05 16:40:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363222815] [2025-02-05 16:40:02,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:02,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:40:02,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:40:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:02,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:03,066 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:03,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:03,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363222815] [2025-02-05 16:40:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363222815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862251481] [2025-02-05 16:40:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:03,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:40:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:03,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:40:03,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:03,067 INFO L87 Difference]: Start difference. First operand 346 states and 460 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:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:03,206 INFO L93 Difference]: Finished difference Result 641 states and 868 transitions. [2025-02-05 16:40:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:40:03,207 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:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:03,208 INFO L225 Difference]: With dead ends: 641 [2025-02-05 16:40:03,208 INFO L226 Difference]: Without dead ends: 338 [2025-02-05 16:40:03,209 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:03,209 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 871 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 196 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:03,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 196 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:03,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-05 16:40:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-05 16:40:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3730886850152906) internal successors, (449), 337 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 449 transitions. [2025-02-05 16:40:03,215 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 449 transitions. Word has length 61 [2025-02-05 16:40:03,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:03,215 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 449 transitions. [2025-02-05 16:40:03,216 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:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 449 transitions. [2025-02-05 16:40:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:40:03,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:03,216 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:03,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:40:03,217 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:03,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -313296833, now seen corresponding path program 1 times [2025-02-05 16:40:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:03,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477164325] [2025-02-05 16:40:03,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:03,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:03,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:40:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:40:03,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:03,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:03,522 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:03,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:03,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477164325] [2025-02-05 16:40:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477164325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:03,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:40:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273288030] [2025-02-05 16:40:03,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:40:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:03,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:40:03,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:40:03,524 INFO L87 Difference]: Start difference. First operand 338 states and 449 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:03,918 INFO L93 Difference]: Finished difference Result 688 states and 918 transitions. [2025-02-05 16:40:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:40:03,918 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:03,920 INFO L225 Difference]: With dead ends: 688 [2025-02-05 16:40:03,920 INFO L226 Difference]: Without dead ends: 503 [2025-02-05 16:40:03,921 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:03,921 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1289 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:03,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 764 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-02-05 16:40:03,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 338. [2025-02-05 16:40:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3700305810397553) internal successors, (448), 337 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 448 transitions. [2025-02-05 16:40:03,930 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 448 transitions. Word has length 62 [2025-02-05 16:40:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:03,930 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 448 transitions. [2025-02-05 16:40:03,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 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:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 448 transitions. [2025-02-05 16:40:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:40:03,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:03,932 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:03,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:40:03,932 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:03,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -733190650, now seen corresponding path program 1 times [2025-02-05 16:40:03,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:03,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610834289] [2025-02-05 16:40:03,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:03,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:40:03,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:40:03,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:03,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:04,225 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:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610834289] [2025-02-05 16:40:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610834289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:04,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885661223] [2025-02-05 16:40:04,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:04,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:04,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:04,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:04,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:04,227 INFO L87 Difference]: Start difference. First operand 338 states and 448 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:04,683 INFO L93 Difference]: Finished difference Result 536 states and 734 transitions. [2025-02-05 16:40:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:04,685 INFO L225 Difference]: With dead ends: 536 [2025-02-05 16:40:04,685 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 16:40:04,685 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:04,686 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 968 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:04,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1134 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 16:40:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-02-05 16:40:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3669724770642202) internal successors, (447), 337 states have internal predecessors, (447), 0 states have call successors, (0), 0 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:04,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 447 transitions. [2025-02-05 16:40:04,693 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 447 transitions. Word has length 62 [2025-02-05 16:40:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:04,693 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 447 transitions. [2025-02-05 16:40:04,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:04,693 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 447 transitions. [2025-02-05 16:40:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:40:04,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:04,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:04,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:40:04,694 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:04,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:04,694 INFO L85 PathProgramCache]: Analyzing trace with hash -506769422, now seen corresponding path program 1 times [2025-02-05 16:40:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:04,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110555255] [2025-02-05 16:40:04,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:04,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:04,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:40:04,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:40:04,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:04,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:04,891 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:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110555255] [2025-02-05 16:40:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110555255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:04,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:04,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701918976] [2025-02-05 16:40:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:04,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:04,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:04,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:04,894 INFO L87 Difference]: Start difference. First operand 338 states and 447 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:05,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:05,271 INFO L93 Difference]: Finished difference Result 667 states and 911 transitions. [2025-02-05 16:40:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:05,271 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:05,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:05,273 INFO L225 Difference]: With dead ends: 667 [2025-02-05 16:40:05,273 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 16:40:05,274 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:05,275 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 771 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:05,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 881 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 16:40:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-02-05 16:40:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.363914373088685) internal successors, (446), 337 states have internal predecessors, (446), 0 states have call successors, (0), 0 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:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 446 transitions. [2025-02-05 16:40:05,285 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 446 transitions. Word has length 62 [2025-02-05 16:40:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 446 transitions. [2025-02-05 16:40:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 8 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:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 446 transitions. [2025-02-05 16:40:05,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:05,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,286 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] [2025-02-05 16:40:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:40:05,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 990894559, now seen corresponding path program 1 times [2025-02-05 16:40:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427335328] [2025-02-05 16:40:05,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:05,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:05,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:05,470 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:05,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:05,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427335328] [2025-02-05 16:40:05,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427335328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:05,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:05,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:05,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787800867] [2025-02-05 16:40:05,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:05,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:05,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:05,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:05,472 INFO L87 Difference]: Start difference. First operand 338 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:05,809 INFO L93 Difference]: Finished difference Result 566 states and 771 transitions. [2025-02-05 16:40:05,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:05,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:05,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:05,811 INFO L225 Difference]: With dead ends: 566 [2025-02-05 16:40:05,811 INFO L226 Difference]: Without dead ends: 396 [2025-02-05 16:40:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:40:05,812 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1360 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:05,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 777 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-02-05 16:40:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 338. [2025-02-05 16:40:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 337 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 444 transitions. [2025-02-05 16:40:05,818 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 444 transitions. Word has length 64 [2025-02-05 16:40:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 444 transitions. [2025-02-05 16:40:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 444 transitions. [2025-02-05 16:40:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:05,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:05,819 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] [2025-02-05 16:40:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:40:05,820 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:05,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1621076992, now seen corresponding path program 1 times [2025-02-05 16:40:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053322307] [2025-02-05 16:40:05,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:05,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:05,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:05,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053322307] [2025-02-05 16:40:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053322307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25669617] [2025-02-05 16:40:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:06,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:06,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:06,021 INFO L87 Difference]: Start difference. First operand 338 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:06,457 INFO L93 Difference]: Finished difference Result 566 states and 752 transitions. [2025-02-05 16:40:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:06,460 INFO L225 Difference]: With dead ends: 566 [2025-02-05 16:40:06,460 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 16:40:06,461 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:06,463 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1315 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:06,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1220 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 16:40:06,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-02-05 16:40:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3516819571865444) internal successors, (442), 337 states have internal predecessors, (442), 0 states have call successors, (0), 0 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:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2025-02-05 16:40:06,471 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 64 [2025-02-05 16:40:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:06,471 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2025-02-05 16:40:06,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2025-02-05 16:40:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:06,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:06,472 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] [2025-02-05 16:40:06,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:40:06,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:06,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash -612939262, now seen corresponding path program 1 times [2025-02-05 16:40:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499911721] [2025-02-05 16:40:06,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:06,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:06,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:06,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:06,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:06,623 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:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499911721] [2025-02-05 16:40:06,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499911721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:06,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:06,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:06,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460408031] [2025-02-05 16:40:06,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:06,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:06,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:06,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:06,624 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:06,982 INFO L93 Difference]: Finished difference Result 534 states and 701 transitions. [2025-02-05 16:40:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:06,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:06,984 INFO L225 Difference]: With dead ends: 534 [2025-02-05 16:40:06,984 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 16:40:06,984 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:06,984 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 777 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:06,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 830 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:06,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 16:40:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-02-05 16:40:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.345565749235474) internal successors, (440), 337 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 440 transitions. [2025-02-05 16:40:06,990 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 440 transitions. Word has length 64 [2025-02-05 16:40:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 440 transitions. [2025-02-05 16:40:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 440 transitions. [2025-02-05 16:40:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:06,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:06,991 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:06,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:40:06,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:06,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 2071658386, now seen corresponding path program 1 times [2025-02-05 16:40:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142920976] [2025-02-05 16:40:06,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:07,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:07,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:07,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:07,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:07,152 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:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:07,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142920976] [2025-02-05 16:40:07,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142920976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:07,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:07,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:07,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702282173] [2025-02-05 16:40:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:07,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:07,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:07,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:07,154 INFO L87 Difference]: Start difference. First operand 338 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:07,531 INFO L93 Difference]: Finished difference Result 534 states and 699 transitions. [2025-02-05 16:40:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:07,534 INFO L225 Difference]: With dead ends: 534 [2025-02-05 16:40:07,534 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 16:40:07,534 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:07,535 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 775 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:07,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 815 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 16:40:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-02-05 16:40:07,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.342507645259939) internal successors, (439), 337 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2025-02-05 16:40:07,541 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 64 [2025-02-05 16:40:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:07,541 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2025-02-05 16:40:07,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2025-02-05 16:40:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:07,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:07,542 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] [2025-02-05 16:40:07,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:40:07,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:07,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:07,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1845369059, now seen corresponding path program 1 times [2025-02-05 16:40:07,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:07,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425169563] [2025-02-05 16:40:07,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:07,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425169563] [2025-02-05 16:40:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425169563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795006296] [2025-02-05 16:40:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:07,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:07,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:07,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:07,711 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:08,080 INFO L93 Difference]: Finished difference Result 637 states and 855 transitions. [2025-02-05 16:40:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:08,082 INFO L225 Difference]: With dead ends: 637 [2025-02-05 16:40:08,082 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 16:40:08,083 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:08,084 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1608 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:08,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 830 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 16:40:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-02-05 16:40:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3394495412844036) internal successors, (438), 337 states have internal predecessors, (438), 0 states have call successors, (0), 0 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:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 438 transitions. [2025-02-05 16:40:08,090 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 438 transitions. Word has length 64 [2025-02-05 16:40:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:08,090 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 438 transitions. [2025-02-05 16:40:08,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 438 transitions. [2025-02-05 16:40:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:08,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:08,091 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] [2025-02-05 16:40:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:40:08,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1450346746, now seen corresponding path program 1 times [2025-02-05 16:40:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087051037] [2025-02-05 16:40:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:08,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:08,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:08,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:08,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:08,248 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:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:08,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087051037] [2025-02-05 16:40:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087051037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:08,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:08,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92987297] [2025-02-05 16:40:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:08,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:08,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:08,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:08,250 INFO L87 Difference]: Start difference. First operand 338 states and 438 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:08,670 INFO L93 Difference]: Finished difference Result 672 states and 907 transitions. [2025-02-05 16:40:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:08,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:08,672 INFO L225 Difference]: With dead ends: 672 [2025-02-05 16:40:08,672 INFO L226 Difference]: Without dead ends: 549 [2025-02-05 16:40:08,672 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:08,673 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 1127 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:08,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1112 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-05 16:40:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 338. [2025-02-05 16:40:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3363914373088686) internal successors, (437), 337 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 437 transitions. [2025-02-05 16:40:08,680 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 437 transitions. Word has length 64 [2025-02-05 16:40:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:08,681 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 437 transitions. [2025-02-05 16:40:08,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 437 transitions. [2025-02-05 16:40:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:40:08,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:08,682 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] [2025-02-05 16:40:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:40:08,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:08,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:08,682 INFO L85 PathProgramCache]: Analyzing trace with hash 610604296, now seen corresponding path program 1 times [2025-02-05 16:40:08,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:08,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101223390] [2025-02-05 16:40:08,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:08,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:08,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:40:08,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:40:08,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:08,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:08,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:08,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101223390] [2025-02-05 16:40:08,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101223390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:08,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:08,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882219155] [2025-02-05 16:40:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:08,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:08,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:08,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:08,862 INFO L87 Difference]: Start difference. First operand 338 states and 437 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:09,248 INFO L93 Difference]: Finished difference Result 640 states and 856 transitions. [2025-02-05 16:40:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:09,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:40:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:09,250 INFO L225 Difference]: With dead ends: 640 [2025-02-05 16:40:09,250 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 16:40:09,250 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:09,251 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1540 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:09,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 882 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 16:40:09,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 338. [2025-02-05 16:40:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 327 states have (on average 1.3333333333333333) internal successors, (436), 337 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2025-02-05 16:40:09,258 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 64 [2025-02-05 16:40:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:09,258 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2025-02-05 16:40:09,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2025-02-05 16:40:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:09,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:09,259 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:09,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:40:09,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 59816032, now seen corresponding path program 1 times [2025-02-05 16:40:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592312616] [2025-02-05 16:40:09,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:09,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:09,734 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:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592312616] [2025-02-05 16:40:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592312616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246996387] [2025-02-05 16:40:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:09,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:09,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:09,735 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:10,338 INFO L93 Difference]: Finished difference Result 828 states and 1090 transitions. [2025-02-05 16:40:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:10,341 INFO L225 Difference]: With dead ends: 828 [2025-02-05 16:40:10,341 INFO L226 Difference]: Without dead ends: 824 [2025-02-05 16:40:10,342 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:10,343 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 1831 mSDsluCounter, 1657 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:10,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 1944 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2025-02-05 16:40:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 334. [2025-02-05 16:40:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.3333333333333333) internal successors, (432), 333 states have internal predecessors, (432), 0 states have call successors, (0), 0 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:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 432 transitions. [2025-02-05 16:40:10,350 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 432 transitions. Word has length 66 [2025-02-05 16:40:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:10,350 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 432 transitions. [2025-02-05 16:40:10,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 432 transitions. [2025-02-05 16:40:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:10,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:10,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:10,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:40:10,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:10,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 587583427, now seen corresponding path program 1 times [2025-02-05 16:40:10,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:10,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391429673] [2025-02-05 16:40:10,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:10,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:10,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:10,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:10,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:10,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:11,381 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:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391429673] [2025-02-05 16:40:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391429673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:11,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:11,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-05 16:40:11,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173588022] [2025-02-05 16:40:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:11,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 16:40:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:11,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 16:40:11,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:40:11,384 INFO L87 Difference]: Start difference. First operand 334 states and 432 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:13,582 INFO L93 Difference]: Finished difference Result 809 states and 1090 transitions. [2025-02-05 16:40:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 16:40:13,582 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:13,584 INFO L225 Difference]: With dead ends: 809 [2025-02-05 16:40:13,584 INFO L226 Difference]: Without dead ends: 702 [2025-02-05 16:40:13,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=372, Invalid=1884, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 16:40:13,585 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 1892 mSDsluCounter, 5898 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1892 SdHoareTripleChecker+Valid, 6348 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:13,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1892 Valid, 6348 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:40:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-05 16:40:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 333. [2025-02-05 16:40:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.3312693498452013) internal successors, (430), 332 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 430 transitions. [2025-02-05 16:40:13,592 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 430 transitions. Word has length 66 [2025-02-05 16:40:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:13,593 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 430 transitions. [2025-02-05 16:40:13,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 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:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 430 transitions. [2025-02-05 16:40:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:13,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:13,593 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:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:40:13,594 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 323524962, now seen corresponding path program 1 times [2025-02-05 16:40:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095939587] [2025-02-05 16:40:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:13,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:13,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:13,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:13,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:14,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:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095939587] [2025-02-05 16:40:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095939587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:14,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-05 16:40:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4052498] [2025-02-05 16:40:14,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:14,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 16:40:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:14,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 16:40:14,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:40:14,160 INFO L87 Difference]: Start difference. First operand 333 states and 430 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 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:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:15,651 INFO L93 Difference]: Finished difference Result 650 states and 857 transitions. [2025-02-05 16:40:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 16:40:15,651 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 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:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:15,653 INFO L225 Difference]: With dead ends: 650 [2025-02-05 16:40:15,653 INFO L226 Difference]: Without dead ends: 644 [2025-02-05 16:40:15,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 16:40:15,654 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1606 mSDsluCounter, 4623 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1606 SdHoareTripleChecker+Valid, 5074 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:15,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1606 Valid, 5074 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:40:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-02-05 16:40:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 333. [2025-02-05 16:40:15,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.328173374613003) internal successors, (429), 332 states have internal predecessors, (429), 0 states have call successors, (0), 0 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:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 429 transitions. [2025-02-05 16:40:15,660 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 429 transitions. Word has length 66 [2025-02-05 16:40:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 429 transitions. [2025-02-05 16:40:15,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 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:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 429 transitions. [2025-02-05 16:40:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:15,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:15,661 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:15,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:40:15,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:15,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1317814465, now seen corresponding path program 1 times [2025-02-05 16:40:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025573987] [2025-02-05 16:40:15,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:15,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:15,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:15,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:15,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:15,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:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025573987] [2025-02-05 16:40:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025573987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:15,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937853186] [2025-02-05 16:40:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:15,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:15,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:15,990 INFO L87 Difference]: Start difference. First operand 333 states and 429 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:16,452 INFO L93 Difference]: Finished difference Result 624 states and 845 transitions. [2025-02-05 16:40:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:16,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:16,454 INFO L225 Difference]: With dead ends: 624 [2025-02-05 16:40:16,454 INFO L226 Difference]: Without dead ends: 496 [2025-02-05 16:40:16,455 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:16,455 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 1227 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:16,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2001 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:16,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-02-05 16:40:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 311. [2025-02-05 16:40:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 303 states have (on average 1.316831683168317) internal successors, (399), 310 states have internal predecessors, (399), 0 states have call successors, (0), 0 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:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 399 transitions. [2025-02-05 16:40:16,460 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 399 transitions. Word has length 66 [2025-02-05 16:40:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:16,460 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 399 transitions. [2025-02-05 16:40:16,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 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:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 399 transitions. [2025-02-05 16:40:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:16,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:16,461 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:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:40:16,461 INFO L396 AbstractCegarLoop]: === Iteration 19 === 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:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash -789563969, now seen corresponding path program 1 times [2025-02-05 16:40:16,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:16,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371738557] [2025-02-05 16:40:16,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:16,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:16,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:16,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:16,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:16,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:16,809 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:16,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:16,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371738557] [2025-02-05 16:40:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371738557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:16,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265262190] [2025-02-05 16:40:16,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:16,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:16,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:16,811 INFO L87 Difference]: Start difference. First operand 311 states and 399 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:17,293 INFO L93 Difference]: Finished difference Result 710 states and 973 transitions. [2025-02-05 16:40:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:40:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:17,295 INFO L225 Difference]: With dead ends: 710 [2025-02-05 16:40:17,295 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 16:40:17,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:40:17,296 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1257 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:17,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2788 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 16:40:17,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 287. [2025-02-05 16:40:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 286 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 369 transitions. [2025-02-05 16:40:17,300 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 369 transitions. Word has length 66 [2025-02-05 16:40:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:17,301 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 369 transitions. [2025-02-05 16:40:17,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 369 transitions. [2025-02-05 16:40:17,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:17,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:17,301 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:17,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:40:17,302 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:17,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:17,302 INFO L85 PathProgramCache]: Analyzing trace with hash -935830778, now seen corresponding path program 1 times [2025-02-05 16:40:17,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:17,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248545186] [2025-02-05 16:40:17,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:17,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:17,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:17,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248545186] [2025-02-05 16:40:17,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248545186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:17,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:17,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051322977] [2025-02-05 16:40:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:17,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:17,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:17,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:17,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:17,713 INFO L87 Difference]: Start difference. First operand 287 states and 369 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:18,372 INFO L93 Difference]: Finished difference Result 843 states and 1144 transitions. [2025-02-05 16:40:18,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:18,374 INFO L225 Difference]: With dead ends: 843 [2025-02-05 16:40:18,374 INFO L226 Difference]: Without dead ends: 733 [2025-02-05 16:40:18,375 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:18,375 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1583 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:18,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 2139 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:40:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-02-05 16:40:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 283. [2025-02-05 16:40:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 277 states have (on average 1.3140794223826715) internal successors, (364), 282 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 364 transitions. [2025-02-05 16:40:18,379 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 364 transitions. Word has length 66 [2025-02-05 16:40:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 364 transitions. [2025-02-05 16:40:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 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:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 364 transitions. [2025-02-05 16:40:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:40:18,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:18,380 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:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:40:18,380 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash -672121848, now seen corresponding path program 1 times [2025-02-05 16:40:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702815934] [2025-02-05 16:40:18,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:18,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:40:18,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:40:18,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:18,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:18,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:18,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702815934] [2025-02-05 16:40:18,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702815934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:18,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:18,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:40:18,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825439300] [2025-02-05 16:40:18,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:18,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:40:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:18,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:40:18,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:40:18,639 INFO L87 Difference]: Start difference. First operand 283 states and 364 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:18,892 INFO L93 Difference]: Finished difference Result 523 states and 710 transitions. [2025-02-05 16:40:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:18,893 INFO L225 Difference]: With dead ends: 523 [2025-02-05 16:40:18,893 INFO L226 Difference]: Without dead ends: 382 [2025-02-05 16:40:18,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:40:18,894 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 751 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:18,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1013 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-05 16:40:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 248. [2025-02-05 16:40:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.319672131147541) internal successors, (322), 247 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 322 transitions. [2025-02-05 16:40:18,898 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 322 transitions. Word has length 66 [2025-02-05 16:40:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:18,898 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 322 transitions. [2025-02-05 16:40:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 322 transitions. [2025-02-05 16:40:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:18,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:18,899 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:18,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:40:18,899 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash 435214982, now seen corresponding path program 1 times [2025-02-05 16:40:18,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:18,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591774470] [2025-02-05 16:40:18,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:18,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:18,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:18,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:19,029 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:19,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:19,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591774470] [2025-02-05 16:40:19,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591774470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:19,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:19,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731471874] [2025-02-05 16:40:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:19,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:19,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:19,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:19,031 INFO L87 Difference]: Start difference. First operand 248 states and 322 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:19,294 INFO L93 Difference]: Finished difference Result 411 states and 544 transitions. [2025-02-05 16:40:19,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:19,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:19,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,296 INFO L225 Difference]: With dead ends: 411 [2025-02-05 16:40:19,296 INFO L226 Difference]: Without dead ends: 404 [2025-02-05 16:40:19,297 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:19,298 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 788 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 517 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-02-05 16:40:19,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 248. [2025-02-05 16:40:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 244 states have (on average 1.3155737704918034) internal successors, (321), 247 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 321 transitions. [2025-02-05 16:40:19,302 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 321 transitions. Word has length 67 [2025-02-05 16:40:19,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:19,303 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 321 transitions. [2025-02-05 16:40:19,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 321 transitions. [2025-02-05 16:40:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:19,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:19,303 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:19,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:40:19,304 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:19,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:19,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1095584606, now seen corresponding path program 1 times [2025-02-05 16:40:19,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:19,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282885164] [2025-02-05 16:40:19,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:19,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:19,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:19,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:19,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:19,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282885164] [2025-02-05 16:40:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282885164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:19,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:19,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:40:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482879425] [2025-02-05 16:40:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:19,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:40:19,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:19,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:40:19,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:40:19,640 INFO L87 Difference]: Start difference. First operand 248 states and 321 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:19,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:19,967 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2025-02-05 16:40:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:40:19,967 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:19,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:19,968 INFO L225 Difference]: With dead ends: 268 [2025-02-05 16:40:19,968 INFO L226 Difference]: Without dead ends: 240 [2025-02-05 16:40:19,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:40:19,969 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 279 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:19,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1411 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-05 16:40:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-02-05 16:40:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 239 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:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 310 transitions. [2025-02-05 16:40:19,972 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 310 transitions. Word has length 67 [2025-02-05 16:40:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:19,972 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 310 transitions. [2025-02-05 16:40:19,972 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:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 310 transitions. [2025-02-05 16:40:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:19,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:19,974 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:19,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:40:19,974 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:19,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:19,974 INFO L85 PathProgramCache]: Analyzing trace with hash 354249932, now seen corresponding path program 1 times [2025-02-05 16:40:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187217179] [2025-02-05 16:40:19,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:19,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:19,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:19,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:20,100 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:20,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:20,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187217179] [2025-02-05 16:40:20,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187217179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:20,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:40:20,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787630529] [2025-02-05 16:40:20,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:20,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:40:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:20,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:40:20,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:40:20,102 INFO L87 Difference]: Start difference. First operand 240 states and 310 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:20,385 INFO L93 Difference]: Finished difference Result 530 states and 722 transitions. [2025-02-05 16:40:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:40:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:20,387 INFO L225 Difference]: With dead ends: 530 [2025-02-05 16:40:20,387 INFO L226 Difference]: Without dead ends: 394 [2025-02-05 16:40:20,387 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:20,388 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 690 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:20,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 687 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-02-05 16:40:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 240. [2025-02-05 16:40:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 236 states have (on average 1.305084745762712) internal successors, (308), 239 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:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 308 transitions. [2025-02-05 16:40:20,391 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 308 transitions. Word has length 67 [2025-02-05 16:40:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 308 transitions. [2025-02-05 16:40:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 8 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:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 308 transitions. [2025-02-05 16:40:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:40:20,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:20,392 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:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:40:20,392 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1163456559, now seen corresponding path program 1 times [2025-02-05 16:40:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372281634] [2025-02-05 16:40:20,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:20,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:40:20,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:40:20,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:20,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:20,969 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:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372281634] [2025-02-05 16:40:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372281634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 16:40:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147164925] [2025-02-05 16:40:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:20,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 16:40:20,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:20,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 16:40:20,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:40:20,970 INFO L87 Difference]: Start difference. First operand 240 states and 308 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:21,494 INFO L93 Difference]: Finished difference Result 346 states and 468 transitions. [2025-02-05 16:40:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:21,494 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:21,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:21,495 INFO L225 Difference]: With dead ends: 346 [2025-02-05 16:40:21,495 INFO L226 Difference]: Without dead ends: 211 [2025-02-05 16:40:21,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:40:21,496 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 218 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:21,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1334 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-05 16:40:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-05 16:40:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 210 states have internal predecessors, (275), 0 states have call successors, (0), 0 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:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 275 transitions. [2025-02-05 16:40:21,498 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 275 transitions. Word has length 67 [2025-02-05 16:40:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:21,498 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 275 transitions. [2025-02-05 16:40:21,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:21,499 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 275 transitions. [2025-02-05 16:40:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:40:21,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:21,499 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:21,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:40:21,499 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:21,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 934143180, now seen corresponding path program 1 times [2025-02-05 16:40:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:21,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379643819] [2025-02-05 16:40:21,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:21,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:40:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:40:21,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:21,835 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:21,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:21,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379643819] [2025-02-05 16:40:21,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379643819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:21,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:21,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:40:21,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730436213] [2025-02-05 16:40:21,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:21,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:40:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:21,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:40:21,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:40:21,837 INFO L87 Difference]: Start difference. First operand 211 states and 275 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,295 INFO L93 Difference]: Finished difference Result 583 states and 815 transitions. [2025-02-05 16:40:22,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:40:22,296 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,298 INFO L225 Difference]: With dead ends: 583 [2025-02-05 16:40:22,298 INFO L226 Difference]: Without dead ends: 577 [2025-02-05 16:40:22,298 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:22,299 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1005 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1355 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:40:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-05 16:40:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 205. [2025-02-05 16:40:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 204 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 268 transitions. [2025-02-05 16:40:22,304 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 268 transitions. Word has length 69 [2025-02-05 16:40:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,305 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 268 transitions. [2025-02-05 16:40:22,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 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:22,305 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 268 transitions. [2025-02-05 16:40:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:40:22,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,305 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] [2025-02-05 16:40:22,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:40:22,306 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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:22,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1779431181, now seen corresponding path program 1 times [2025-02-05 16:40:22,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139448234] [2025-02-05 16:40:22,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:40:22,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:40:22,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:22,373 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:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139448234] [2025-02-05 16:40:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139448234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:22,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158396632] [2025-02-05 16:40:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:22,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:22,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:22,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:22,374 INFO L87 Difference]: Start difference. First operand 205 states and 268 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,472 INFO L93 Difference]: Finished difference Result 1053 states and 1548 transitions. [2025-02-05 16:40:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:40:22,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 16:40:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,475 INFO L225 Difference]: With dead ends: 1053 [2025-02-05 16:40:22,475 INFO L226 Difference]: Without dead ends: 947 [2025-02-05 16:40:22,476 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:22,476 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 831 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1028 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-02-05 16:40:22,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 309. [2025-02-05 16:40:22,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3733766233766234) internal successors, (423), 308 states have internal predecessors, (423), 0 states have call successors, (0), 0 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:22,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2025-02-05 16:40:22,483 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 92 [2025-02-05 16:40:22,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,483 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2025-02-05 16:40:22,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2025-02-05 16:40:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:22,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,484 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] [2025-02-05 16:40:22,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:40:22,484 INFO L396 AbstractCegarLoop]: === Iteration 28 === 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:22,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1762348105, now seen corresponding path program 1 times [2025-02-05 16:40:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493874396] [2025-02-05 16:40:22,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:22,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:22,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:22,573 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:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:22,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493874396] [2025-02-05 16:40:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493874396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:22,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390356944] [2025-02-05 16:40:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:22,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:22,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:22,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:22,575 INFO L87 Difference]: Start difference. First operand 309 states and 423 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,636 INFO L93 Difference]: Finished difference Result 1255 states and 1839 transitions. [2025-02-05 16:40:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:22,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:40:22,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,639 INFO L225 Difference]: With dead ends: 1255 [2025-02-05 16:40:22,639 INFO L226 Difference]: Without dead ends: 1045 [2025-02-05 16:40:22,639 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:22,640 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 579 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 736 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-02-05 16:40:22,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 517. [2025-02-05 16:40:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.4244186046511629) internal successors, (735), 516 states have internal predecessors, (735), 0 states have call successors, (0), 0 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:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 735 transitions. [2025-02-05 16:40:22,652 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 735 transitions. Word has length 94 [2025-02-05 16:40:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,652 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 735 transitions. [2025-02-05 16:40:22,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 735 transitions. [2025-02-05 16:40:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:22,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,653 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] [2025-02-05 16:40:22,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:40:22,654 INFO L396 AbstractCegarLoop]: === Iteration 29 === 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:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -609122327, now seen corresponding path program 1 times [2025-02-05 16:40:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222507944] [2025-02-05 16:40:22,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:22,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:22,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:22,726 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:22,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222507944] [2025-02-05 16:40:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222507944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:22,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101708457] [2025-02-05 16:40:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:22,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:22,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:22,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:22,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:22,728 INFO L87 Difference]: Start difference. First operand 517 states and 735 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,788 INFO L93 Difference]: Finished difference Result 1463 states and 2151 transitions. [2025-02-05 16:40:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:22,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:40:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,792 INFO L225 Difference]: With dead ends: 1463 [2025-02-05 16:40:22,792 INFO L226 Difference]: Without dead ends: 1253 [2025-02-05 16:40:22,793 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:22,794 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 620 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 683 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2025-02-05 16:40:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 829. [2025-02-05 16:40:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4516908212560387) internal successors, (1202), 828 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1202 transitions. [2025-02-05 16:40:22,807 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1202 transitions. Word has length 94 [2025-02-05 16:40:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,808 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1202 transitions. [2025-02-05 16:40:22,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1202 transitions. [2025-02-05 16:40:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:22,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,808 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] [2025-02-05 16:40:22,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:40:22,809 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:22,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1560712073, now seen corresponding path program 1 times [2025-02-05 16:40:22,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695422824] [2025-02-05 16:40:22,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:22,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:22,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:22,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:22,890 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:22,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:22,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695422824] [2025-02-05 16:40:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695422824] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:22,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:22,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:22,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294945148] [2025-02-05 16:40:22,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:22,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:22,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:22,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:22,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:22,892 INFO L87 Difference]: Start difference. First operand 829 states and 1202 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:22,960 INFO L93 Difference]: Finished difference Result 1671 states and 2463 transitions. [2025-02-05 16:40:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:22,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:40:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:22,964 INFO L225 Difference]: With dead ends: 1671 [2025-02-05 16:40:22,964 INFO L226 Difference]: Without dead ends: 1461 [2025-02-05 16:40:22,964 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:22,965 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 595 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:22,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 736 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:22,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-02-05 16:40:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1037. [2025-02-05 16:40:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 1.4613899613899615) internal successors, (1514), 1036 states have internal predecessors, (1514), 0 states have call successors, (0), 0 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:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1514 transitions. [2025-02-05 16:40:22,978 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1514 transitions. Word has length 94 [2025-02-05 16:40:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:22,978 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1514 transitions. [2025-02-05 16:40:22,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:22,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1514 transitions. [2025-02-05 16:40:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:22,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:22,980 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] [2025-02-05 16:40:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:40:22,980 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:22,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1840747204, now seen corresponding path program 1 times [2025-02-05 16:40:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336913530] [2025-02-05 16:40:22,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:22,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:23,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:23,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,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:23,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336913530] [2025-02-05 16:40:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336913530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:23,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462988736] [2025-02-05 16:40:23,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:23,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:23,024 INFO L87 Difference]: Start difference. First operand 1037 states and 1514 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,046 INFO L93 Difference]: Finished difference Result 2797 states and 4122 transitions. [2025-02-05 16:40:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:40:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,051 INFO L225 Difference]: With dead ends: 2797 [2025-02-05 16:40:23,051 INFO L226 Difference]: Without dead ends: 1859 [2025-02-05 16:40:23,052 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:23,052 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 90 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:23,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2025-02-05 16:40:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1839. [2025-02-05 16:40:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.442328618063112) internal successors, (2651), 1838 states have internal predecessors, (2651), 0 states have call successors, (0), 0 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:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2651 transitions. [2025-02-05 16:40:23,072 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2651 transitions. Word has length 94 [2025-02-05 16:40:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,072 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2651 transitions. [2025-02-05 16:40:23,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2651 transitions. [2025-02-05 16:40:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:40:23,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,074 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] [2025-02-05 16:40:23,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:40:23,074 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:23,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1876764523, now seen corresponding path program 1 times [2025-02-05 16:40:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57461042] [2025-02-05 16:40:23,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:40:23,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:40:23,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,202 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:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57461042] [2025-02-05 16:40:23,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57461042] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:23,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682044642] [2025-02-05 16:40:23,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:23,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:23,205 INFO L87 Difference]: Start difference. First operand 1839 states and 2651 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,276 INFO L93 Difference]: Finished difference Result 3581 states and 5195 transitions. [2025-02-05 16:40:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:40:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,280 INFO L225 Difference]: With dead ends: 3581 [2025-02-05 16:40:23,281 INFO L226 Difference]: Without dead ends: 1841 [2025-02-05 16:40:23,282 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:23,283 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 140 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:23,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 388 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2025-02-05 16:40:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1839. [2025-02-05 16:40:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.4368879216539716) internal successors, (2641), 1838 states have internal predecessors, (2641), 0 states have call successors, (0), 0 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:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2641 transitions. [2025-02-05 16:40:23,305 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2641 transitions. Word has length 94 [2025-02-05 16:40:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,305 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2641 transitions. [2025-02-05 16:40:23,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:23,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2641 transitions. [2025-02-05 16:40:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:40:23,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,307 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:23,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:40:23,307 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:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1920257440, now seen corresponding path program 1 times [2025-02-05 16:40:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360426136] [2025-02-05 16:40:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:40:23,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:40:23,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,365 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:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360426136] [2025-02-05 16:40:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360426136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:23,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291511915] [2025-02-05 16:40:23,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:23,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:23,366 INFO L87 Difference]: Start difference. First operand 1839 states and 2641 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:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,388 INFO L93 Difference]: Finished difference Result 5175 states and 7455 transitions. [2025-02-05 16:40:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:23,388 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:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,395 INFO L225 Difference]: With dead ends: 5175 [2025-02-05 16:40:23,395 INFO L226 Difference]: Without dead ends: 3435 [2025-02-05 16:40:23,398 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:23,398 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 335 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:23,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 335 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:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2025-02-05 16:40:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3289. [2025-02-05 16:40:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 3288 states have (on average 1.4309610705596107) internal successors, (4705), 3288 states have internal predecessors, (4705), 0 states have call successors, (0), 0 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:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4705 transitions. [2025-02-05 16:40:23,433 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4705 transitions. Word has length 95 [2025-02-05 16:40:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,434 INFO L471 AbstractCegarLoop]: Abstraction has 3289 states and 4705 transitions. [2025-02-05 16:40:23,434 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:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4705 transitions. [2025-02-05 16:40:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:40:23,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,435 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:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:40:23,435 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:23,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1341386876, now seen corresponding path program 1 times [2025-02-05 16:40:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798917918] [2025-02-05 16:40:23,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:40:23,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:40:23,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,495 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:23,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798917918] [2025-02-05 16:40:23,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798917918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716318756] [2025-02-05 16:40:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:23,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:23,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:23,496 INFO L87 Difference]: Start difference. First operand 3289 states and 4705 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:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,524 INFO L93 Difference]: Finished difference Result 9381 states and 13395 transitions. [2025-02-05 16:40:23,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:23,525 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:23,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,546 INFO L225 Difference]: With dead ends: 9381 [2025-02-05 16:40:23,547 INFO L226 Difference]: Without dead ends: 6191 [2025-02-05 16:40:23,554 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:23,554 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 66 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 335 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:23,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 335 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:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6191 states. [2025-02-05 16:40:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6191 to 5901. [2025-02-05 16:40:23,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5901 states, 5900 states have (on average 1.4177966101694914) internal successors, (8365), 5900 states have internal predecessors, (8365), 0 states have call successors, (0), 0 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:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5901 states to 5901 states and 8365 transitions. [2025-02-05 16:40:23,649 INFO L78 Accepts]: Start accepts. Automaton has 5901 states and 8365 transitions. Word has length 96 [2025-02-05 16:40:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,650 INFO L471 AbstractCegarLoop]: Abstraction has 5901 states and 8365 transitions. [2025-02-05 16:40:23,650 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:23,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5901 states and 8365 transitions. [2025-02-05 16:40:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:40:23,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,655 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:23,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:40:23,655 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:23,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1272713517, now seen corresponding path program 1 times [2025-02-05 16:40:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857391311] [2025-02-05 16:40:23,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:40:23,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:40:23,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:23,762 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:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857391311] [2025-02-05 16:40:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857391311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:23,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751585247] [2025-02-05 16:40:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:23,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:23,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:23,763 INFO L87 Difference]: Start difference. First operand 5901 states and 8365 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:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:23,801 INFO L93 Difference]: Finished difference Result 16929 states and 23871 transitions. [2025-02-05 16:40:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:23,802 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:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:23,822 INFO L225 Difference]: With dead ends: 16929 [2025-02-05 16:40:23,822 INFO L226 Difference]: Without dead ends: 11127 [2025-02-05 16:40:23,837 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:23,838 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 56 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 335 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:23,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 335 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:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11127 states. [2025-02-05 16:40:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11127 to 10549. [2025-02-05 16:40:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10549 states, 10548 states have (on average 1.3982745544178992) internal successors, (14749), 10548 states have internal predecessors, (14749), 0 states have call successors, (0), 0 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:23,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10549 states to 10549 states and 14749 transitions. [2025-02-05 16:40:23,958 INFO L78 Accepts]: Start accepts. Automaton has 10549 states and 14749 transitions. Word has length 97 [2025-02-05 16:40:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:23,958 INFO L471 AbstractCegarLoop]: Abstraction has 10549 states and 14749 transitions. [2025-02-05 16:40:23,958 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:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 10549 states and 14749 transitions. [2025-02-05 16:40:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:40:23,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:23,959 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:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:40:23,959 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:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 870655439, now seen corresponding path program 1 times [2025-02-05 16:40:23,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:23,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828479367] [2025-02-05 16:40:23,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:23,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:40:23,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:40:23,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:23,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,115 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:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828479367] [2025-02-05 16:40:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828479367] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124726399] [2025-02-05 16:40:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:24,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:24,116 INFO L87 Difference]: Start difference. First operand 10549 states and 14749 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,148 INFO L93 Difference]: Finished difference Result 10935 states and 15262 transitions. [2025-02-05 16:40:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,165 INFO L225 Difference]: With dead ends: 10935 [2025-02-05 16:40:24,165 INFO L226 Difference]: Without dead ends: 10933 [2025-02-05 16:40:24,168 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:24,168 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:24,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:24,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2025-02-05 16:40:24,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10933. [2025-02-05 16:40:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10933 states, 10932 states have (on average 1.3769667032564947) internal successors, (15053), 10932 states have internal predecessors, (15053), 0 states have call successors, (0), 0 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:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 15053 transitions. [2025-02-05 16:40:24,295 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 15053 transitions. Word has length 98 [2025-02-05 16:40:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:24,295 INFO L471 AbstractCegarLoop]: Abstraction has 10933 states and 15053 transitions. [2025-02-05 16:40:24,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 15053 transitions. [2025-02-05 16:40:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:40:24,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:24,296 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:24,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:40:24,296 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:24,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:24,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1942643465, now seen corresponding path program 1 times [2025-02-05 16:40:24,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:24,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972429763] [2025-02-05 16:40:24,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:24,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:24,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:40:24,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:40:24,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:24,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,404 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:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972429763] [2025-02-05 16:40:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972429763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:40:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441933133] [2025-02-05 16:40:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:40:24,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:40:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:40:24,406 INFO L87 Difference]: Start difference. First operand 10933 states and 15053 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,511 INFO L93 Difference]: Finished difference Result 20607 states and 28498 transitions. [2025-02-05 16:40:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:40:24,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,538 INFO L225 Difference]: With dead ends: 20607 [2025-02-05 16:40:24,538 INFO L226 Difference]: Without dead ends: 18189 [2025-02-05 16:40:24,545 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:24,545 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 590 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:24,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 811 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18189 states. [2025-02-05 16:40:24,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18189 to 13349. [2025-02-05 16:40:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13349 states, 13348 states have (on average 1.3770602337428828) internal successors, (18381), 13348 states have internal predecessors, (18381), 0 states have call successors, (0), 0 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:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13349 states to 13349 states and 18381 transitions. [2025-02-05 16:40:24,698 INFO L78 Accepts]: Start accepts. Automaton has 13349 states and 18381 transitions. Word has length 98 [2025-02-05 16:40:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:24,698 INFO L471 AbstractCegarLoop]: Abstraction has 13349 states and 18381 transitions. [2025-02-05 16:40:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 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:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 13349 states and 18381 transitions. [2025-02-05 16:40:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:40:24,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:24,699 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:24,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:40:24,699 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:24,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:24,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1536114337, now seen corresponding path program 1 times [2025-02-05 16:40:24,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:24,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858805963] [2025-02-05 16:40:24,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:24,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:40:24,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:40:24,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:24,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,788 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:24,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858805963] [2025-02-05 16:40:24,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858805963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:24,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198465390] [2025-02-05 16:40:24,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:24,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:24,789 INFO L87 Difference]: Start difference. First operand 13349 states and 18381 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:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:24,850 INFO L93 Difference]: Finished difference Result 34745 states and 47783 transitions. [2025-02-05 16:40:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:24,850 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:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:24,879 INFO L225 Difference]: With dead ends: 34745 [2025-02-05 16:40:24,880 INFO L226 Difference]: Without dead ends: 21495 [2025-02-05 16:40:24,894 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:24,894 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 77 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 338 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:24,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 338 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:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21495 states. [2025-02-05 16:40:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21495 to 20085. [2025-02-05 16:40:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3553574985062737) internal successors, (27221), 20084 states have internal predecessors, (27221), 0 states have call successors, (0), 0 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:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 27221 transitions. [2025-02-05 16:40:25,198 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 27221 transitions. Word has length 99 [2025-02-05 16:40:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:25,199 INFO L471 AbstractCegarLoop]: Abstraction has 20085 states and 27221 transitions. [2025-02-05 16:40:25,199 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:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 27221 transitions. [2025-02-05 16:40:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:40:25,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:25,203 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:40:25,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:40:25,203 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:25,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 343834162, now seen corresponding path program 1 times [2025-02-05 16:40:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429986332] [2025-02-05 16:40:25,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:25,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:40:25,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:40:25,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429986332] [2025-02-05 16:40:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429986332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:25,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:25,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:25,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561639561] [2025-02-05 16:40:25,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:25,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:25,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:25,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:25,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:25,325 INFO L87 Difference]: Start difference. First operand 20085 states and 27221 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:25,407 INFO L93 Difference]: Finished difference Result 40073 states and 54335 transitions. [2025-02-05 16:40:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-05 16:40:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:25,431 INFO L225 Difference]: With dead ends: 40073 [2025-02-05 16:40:25,431 INFO L226 Difference]: Without dead ends: 20087 [2025-02-05 16:40:25,448 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:25,449 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 69 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 311 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:40:25,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 311 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20087 states. [2025-02-05 16:40:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20087 to 20085. [2025-02-05 16:40:25,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20085 states, 20084 states have (on average 1.3378311093407689) internal successors, (26869), 20084 states have internal predecessors, (26869), 0 states have call successors, (0), 0 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:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20085 states to 20085 states and 26869 transitions. [2025-02-05 16:40:25,748 INFO L78 Accepts]: Start accepts. Automaton has 20085 states and 26869 transitions. Word has length 125 [2025-02-05 16:40:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:25,748 INFO L471 AbstractCegarLoop]: Abstraction has 20085 states and 26869 transitions. [2025-02-05 16:40:25,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:25,748 INFO L276 IsEmpty]: Start isEmpty. Operand 20085 states and 26869 transitions. [2025-02-05 16:40:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:40:25,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:25,752 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] [2025-02-05 16:40:25,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:40:25,753 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:25,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:25,753 INFO L85 PathProgramCache]: Analyzing trace with hash 781934089, now seen corresponding path program 1 times [2025-02-05 16:40:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:25,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122392610] [2025-02-05 16:40:25,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:25,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:25,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:40:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:40:25,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122392610] [2025-02-05 16:40:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122392610] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312599409] [2025-02-05 16:40:26,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:26,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:26,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:26,154 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:26,155 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:26,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:40:26,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:40:26,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:26,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:26,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:26,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:27,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:28,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312599409] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:28,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:28,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2025-02-05 16:40:28,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984035590] [2025-02-05 16:40:28,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:40:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:28,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:40:28,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:40:28,191 INFO L87 Difference]: Start difference. First operand 20085 states and 26869 transitions. Second operand has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 0 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,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:31,092 INFO L93 Difference]: Finished difference Result 163976 states and 217807 transitions. [2025-02-05 16:40:31,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-02-05 16:40:31,093 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 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 125 [2025-02-05 16:40:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:31,254 INFO L225 Difference]: With dead ends: 163976 [2025-02-05 16:40:31,254 INFO L226 Difference]: Without dead ends: 143990 [2025-02-05 16:40:31,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2236, Invalid=13016, Unknown=0, NotChecked=0, Total=15252 [2025-02-05 16:40:31,410 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 3484 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:31,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 2344 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:40:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143990 states. [2025-02-05 16:40:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143990 to 72622. [2025-02-05 16:40:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72622 states, 72621 states have (on average 1.3245755360019829) internal successors, (96192), 72621 states have internal predecessors, (96192), 0 states have call successors, (0), 0 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,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72622 states to 72622 states and 96192 transitions. [2025-02-05 16:40:32,420 INFO L78 Accepts]: Start accepts. Automaton has 72622 states and 96192 transitions. Word has length 125 [2025-02-05 16:40:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:32,420 INFO L471 AbstractCegarLoop]: Abstraction has 72622 states and 96192 transitions. [2025-02-05 16:40:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.571428571428571) internal successors, (296), 27 states have internal predecessors, (296), 0 states have call successors, (0), 0 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,420 INFO L276 IsEmpty]: Start isEmpty. Operand 72622 states and 96192 transitions. [2025-02-05 16:40:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:40:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:32,426 INFO L218 NwaCegarLoop]: trace histogram [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:40:32,434 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:40:32,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-05 16:40:32,627 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:32,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:32,628 INFO L85 PathProgramCache]: Analyzing trace with hash -831569981, now seen corresponding path program 1 times [2025-02-05 16:40:32,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:32,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491400734] [2025-02-05 16:40:32,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:32,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:32,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:32,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491400734] [2025-02-05 16:40:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491400734] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812318083] [2025-02-05 16:40:33,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:33,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:33,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:33,139 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:40:33,140 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:40:33,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:33,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:33,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:33,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:33,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 16:40:33,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:33,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:34,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812318083] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:34,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:34,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 30 [2025-02-05 16:40:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835123472] [2025-02-05 16:40:34,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:34,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:40:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:34,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:40:34,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:40:34,166 INFO L87 Difference]: Start difference. First operand 72622 states and 96192 transitions. Second operand has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 0 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,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:36,187 INFO L93 Difference]: Finished difference Result 206512 states and 273475 transitions. [2025-02-05 16:40:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-02-05 16:40:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 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 126 [2025-02-05 16:40:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:36,316 INFO L225 Difference]: With dead ends: 206512 [2025-02-05 16:40:36,316 INFO L226 Difference]: Without dead ends: 133996 [2025-02-05 16:40:36,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=694, Invalid=5626, Unknown=0, NotChecked=0, Total=6320 [2025-02-05 16:40:36,355 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1087 mSDsluCounter, 7222 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 7571 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:36,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 7571 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:40:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133996 states. [2025-02-05 16:40:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133996 to 98666. [2025-02-05 16:40:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98666 states, 98665 states have (on average 1.3248973800233113) internal successors, (130721), 98665 states have internal predecessors, (130721), 0 states have call successors, (0), 0 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,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98666 states to 98666 states and 130721 transitions. [2025-02-05 16:40:37,690 INFO L78 Accepts]: Start accepts. Automaton has 98666 states and 130721 transitions. Word has length 126 [2025-02-05 16:40:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:37,691 INFO L471 AbstractCegarLoop]: Abstraction has 98666 states and 130721 transitions. [2025-02-05 16:40:37,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.033333333333333) internal successors, (331), 30 states have internal predecessors, (331), 0 states have call successors, (0), 0 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,691 INFO L276 IsEmpty]: Start isEmpty. Operand 98666 states and 130721 transitions. [2025-02-05 16:40:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:40:37,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:37,700 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] [2025-02-05 16:40:37,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:40:37,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:37,901 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:37,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash 486104220, now seen corresponding path program 1 times [2025-02-05 16:40:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:37,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904384659] [2025-02-05 16:40:37,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:37,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:37,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:37,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:37,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:40:37,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:37,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904384659] [2025-02-05 16:40:37,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904384659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:37,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:37,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2934884] [2025-02-05 16:40:37,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:37,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:40:37,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:37,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:40:37,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:40:37,972 INFO L87 Difference]: Start difference. First operand 98666 states and 130721 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:38,682 INFO L93 Difference]: Finished difference Result 200634 states and 265451 transitions. [2025-02-05 16:40:38,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:40:38,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-02-05 16:40:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:38,783 INFO L225 Difference]: With dead ends: 200634 [2025-02-05 16:40:38,783 INFO L226 Difference]: Without dead ends: 131024 [2025-02-05 16:40:38,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:40:38,806 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:38,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 291 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:40:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131024 states. [2025-02-05 16:40:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131024 to 98314. [2025-02-05 16:40:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98314 states, 98313 states have (on average 1.3224802416770927) internal successors, (130017), 98313 states have internal predecessors, (130017), 0 states have call successors, (0), 0 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,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98314 states to 98314 states and 130017 transitions. [2025-02-05 16:40:40,005 INFO L78 Accepts]: Start accepts. Automaton has 98314 states and 130017 transitions. Word has length 126 [2025-02-05 16:40:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:40,005 INFO L471 AbstractCegarLoop]: Abstraction has 98314 states and 130017 transitions. [2025-02-05 16:40:40,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 98314 states and 130017 transitions. [2025-02-05 16:40:40,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 16:40:40,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:40,011 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] [2025-02-05 16:40:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:40:40,012 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:40,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1083307491, now seen corresponding path program 1 times [2025-02-05 16:40:40,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367713357] [2025-02-05 16:40:40,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:40,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:40,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:40,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:40,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367713357] [2025-02-05 16:40:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367713357] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:40,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857765617] [2025-02-05 16:40:40,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:40,454 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:40:40,456 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:40:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 16:40:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 16:40:40,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:40,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:40,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-05 16:40:40,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:41,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:41,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857765617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:41,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:41,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2025-02-05 16:40:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051523331] [2025-02-05 16:40:41,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:41,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:40:41,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:41,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:40:41,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:40:41,717 INFO L87 Difference]: Start difference. First operand 98314 states and 130017 transitions. Second operand has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 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,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:48,797 INFO L93 Difference]: Finished difference Result 550861 states and 728004 transitions. [2025-02-05 16:40:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2025-02-05 16:40:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 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 126 [2025-02-05 16:40:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:49,323 INFO L225 Difference]: With dead ends: 550861 [2025-02-05 16:40:49,323 INFO L226 Difference]: Without dead ends: 452679 [2025-02-05 16:40:49,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6603 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2950, Invalid=17642, Unknown=0, NotChecked=0, Total=20592 [2025-02-05 16:40:49,361 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 3147 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3147 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 3240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:49,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3147 Valid, 2409 Invalid, 3240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:40:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452679 states. [2025-02-05 16:40:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452679 to 291031. [2025-02-05 16:40:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291031 states, 291030 states have (on average 1.3187162835446518) internal successors, (383786), 291030 states have internal predecessors, (383786), 0 states have call successors, (0), 0 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,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291031 states to 291031 states and 383786 transitions. [2025-02-05 16:40:53,626 INFO L78 Accepts]: Start accepts. Automaton has 291031 states and 383786 transitions. Word has length 126 [2025-02-05 16:40:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:53,627 INFO L471 AbstractCegarLoop]: Abstraction has 291031 states and 383786 transitions. [2025-02-05 16:40:53,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.807692307692308) internal successors, (333), 26 states have internal predecessors, (333), 0 states have call successors, (0), 0 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,627 INFO L276 IsEmpty]: Start isEmpty. Operand 291031 states and 383786 transitions. [2025-02-05 16:40:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:40:53,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:53,642 INFO L218 NwaCegarLoop]: trace histogram [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:40:53,649 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:40:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:53,843 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:40:53,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:53,844 INFO L85 PathProgramCache]: Analyzing trace with hash -895987249, now seen corresponding path program 1 times [2025-02-05 16:40:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013254341] [2025-02-05 16:40:53,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:53,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:53,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:53,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013254341] [2025-02-05 16:40:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013254341] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053140197] [2025-02-05 16:40:54,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:54,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:54,365 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:40:54,366 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:40:54,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:54,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:54,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:54,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:54,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:54,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:55,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053140197] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:56,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2025-02-05 16:40:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126375068] [2025-02-05 16:40:56,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:56,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:40:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:56,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:40:56,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:40:56,096 INFO L87 Difference]: Start difference. First operand 291031 states and 383786 transitions. Second operand has 32 states, 32 states have (on average 10.96875) internal successors, (351), 32 states have internal predecessors, (351), 0 states have call successors, (0), 0 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,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:41:07,285 INFO L93 Difference]: Finished difference Result 1256839 states and 1645162 transitions. [2025-02-05 16:41:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-02-05 16:41:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.96875) internal successors, (351), 32 states have internal predecessors, (351), 0 states have call successors, (0), 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:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:41:09,067 INFO L225 Difference]: With dead ends: 1256839 [2025-02-05 16:41:09,068 INFO L226 Difference]: Without dead ends: 965973 [2025-02-05 16:41:09,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13980 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5762, Invalid=32068, Unknown=0, NotChecked=0, Total=37830 [2025-02-05 16:41:09,239 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 4938 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 4574 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4938 SdHoareTripleChecker+Valid, 3355 SdHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 4574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:41:09,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4938 Valid, 3355 Invalid, 4665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 4574 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 16:41:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965973 states.