./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:39:34,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:39:34,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:39:34,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:39:34,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:39:34,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:39:34,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:39:34,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:39:34,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:39:34,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:39:34,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:39:34,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:39:34,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:34,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:39:34,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:39:34,336 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 -> c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 [2025-02-05 16:39:34,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:39:34,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:39:34,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:39:34,561 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:39:34,561 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:39:34,563 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.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:39:35,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6825020dc/3bb743d1eaa44d2895581c41728a0f37/FLAGd2633898f [2025-02-05 16:39:36,066 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:39:36,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:39:36,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6825020dc/3bb743d1eaa44d2895581c41728a0f37/FLAGd2633898f [2025-02-05 16:39:36,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6825020dc/3bb743d1eaa44d2895581c41728a0f37 [2025-02-05 16:39:36,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:39:36,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:39:36,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:36,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:39:36,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:39:36,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:36" (1/1) ... [2025-02-05 16:39:36,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f31cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:36, skipping insertion in model container [2025-02-05 16:39:36,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:39:36" (1/1) ... [2025-02-05 16:39:36,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:39:36,332 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.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-02-05 16:39:36,353 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.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-02-05 16:39:36,358 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.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-02-05 16:39:36,365 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.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-02-05 16:39:36,372 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.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-02-05 16:39:36,374 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.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-02-05 16:39:36,378 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.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-02-05 16:39:36,387 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.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-02-05 16:39:36,391 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.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-02-05 16:39:36,398 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.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-02-05 16:39:36,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-02-05 16:39:36,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:36,501 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:39:36,537 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.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-02-05 16:39:36,543 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.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-02-05 16:39:36,546 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.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-02-05 16:39:36,548 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.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-02-05 16:39:36,551 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.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-02-05 16:39:36,553 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.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-02-05 16:39:36,555 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.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-02-05 16:39:36,560 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.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-02-05 16:39:36,564 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.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-02-05 16:39:36,570 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.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-02-05 16:39:36,580 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.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-02-05 16:39:36,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:39:36,661 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:39:36,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:36 WrapperNode [2025-02-05 16:39:36,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:39:36,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:36,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:39:36,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:39:36,678 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:36" (1/1) ... [2025-02-05 16:39:36,693 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:36" (1/1) ... [2025-02-05 16:39:36,734 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2022 [2025-02-05 16:39:36,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:39:36,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:39:36,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:39:36,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:39:36,742 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:36" (1/1) ... [2025-02-05 16:39:36,742 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:36" (1/1) ... [2025-02-05 16:39:36,746 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:36" (1/1) ... [2025-02-05 16:39:36,769 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:36,770 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:36" (1/1) ... [2025-02-05 16:39:36,770 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:36" (1/1) ... [2025-02-05 16:39:36,783 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:36" (1/1) ... [2025-02-05 16:39:36,785 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:36" (1/1) ... [2025-02-05 16:39:36,787 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:36" (1/1) ... [2025-02-05 16:39:36,789 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:36" (1/1) ... [2025-02-05 16:39:36,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:39:36,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:39:36,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:39:36,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:39:36,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:36" (1/1) ... [2025-02-05 16:39:36,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:39:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:36,829 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:39:36,834 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:39:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:39:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:39:36,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:39:36,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:39:36,999 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:39:37,000 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:39:38,064 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L927: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1094: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node3__m3~2#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: havoc main_~node3__m3~4#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:38,065 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node4__m4~3#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1399: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node4__m4~4#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~check__tmp~9#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: havoc main_~node4__m4~5#1; [2025-02-05 16:39:38,066 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2095: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node3__m3~5#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc main_~node4__m4~1#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node2__m2~1#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L878: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node4__m4~2#1; [2025-02-05 16:39:38,067 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1308: havoc main_~node4__m4~6#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442: havoc main_~node4__m4~7#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1509: havoc main_~check__tmp~13#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node2__m2~2#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: havoc main_~node2__m2~3#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2272: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-05 16:39:38,068 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1350: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~check__tmp~15#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node4__m4~8#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node3__m3~3#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1616: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2046: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node3__m3~1#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-05 16:39:38,069 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:39:38,125 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2025-02-05 16:39:38,125 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:39:38,137 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:39:38,138 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:39:38,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:38 BoogieIcfgContainer [2025-02-05 16:39:38,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:39:38,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:39:38,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:39:38,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:39:38,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:39:36" (1/3) ... [2025-02-05 16:39:38,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23feecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:38, skipping insertion in model container [2025-02-05 16:39:38,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:39:36" (2/3) ... [2025-02-05 16:39:38,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23feecfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:39:38, skipping insertion in model container [2025-02-05 16:39:38,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:39:38" (3/3) ... [2025-02-05 16:39:38,154 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:39:38,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:39:38,183 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 358 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-05 16:39:38,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:39:38,256 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;@67b2e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:39:38,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-05 16:39:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:39:38,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:38,272 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:39:38,272 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:39:38,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1251606518, now seen corresponding path program 1 times [2025-02-05 16:39:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:38,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526601090] [2025-02-05 16:39:38,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:39:38,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:39:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526601090] [2025-02-05 16:39:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526601090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847797804] [2025-02-05 16:39:38,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:38,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:38,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:38,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:38,832 INFO L87 Difference]: Start difference. First operand has 358 states, 346 states have (on average 1.8381502890173411) internal successors, (636), 357 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:39,129 INFO L93 Difference]: Finished difference Result 570 states and 974 transitions. [2025-02-05 16:39:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-02-05 16:39:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:39,141 INFO L225 Difference]: With dead ends: 570 [2025-02-05 16:39:39,142 INFO L226 Difference]: Without dead ends: 315 [2025-02-05 16:39:39,144 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:39:39,146 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 1503 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:39,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 404 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-05 16:39:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2025-02-05 16:39:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 304 states have (on average 1.2763157894736843) internal successors, (388), 314 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 388 transitions. [2025-02-05 16:39:39,193 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 388 transitions. Word has length 59 [2025-02-05 16:39:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:39,194 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 388 transitions. [2025-02-05 16:39:39,194 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:39:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 388 transitions. [2025-02-05 16:39:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 16:39:39,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:39,197 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:39:39,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:39:39,198 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:39:39,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:39,199 INFO L85 PathProgramCache]: Analyzing trace with hash -699038653, now seen corresponding path program 1 times [2025-02-05 16:39:39,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:39,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689851370] [2025-02-05 16:39:39,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:39,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:39,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 16:39:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 16:39:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:39,384 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:39:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689851370] [2025-02-05 16:39:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689851370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054180151] [2025-02-05 16:39:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:39,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:39,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:39,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:39,387 INFO L87 Difference]: Start difference. First operand 315 states and 388 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:39:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:39,608 INFO L93 Difference]: Finished difference Result 652 states and 835 transitions. [2025-02-05 16:39:39,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:39,608 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:39:39,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:39,610 INFO L225 Difference]: With dead ends: 652 [2025-02-05 16:39:39,610 INFO L226 Difference]: Without dead ends: 408 [2025-02-05 16:39:39,611 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:39:39,611 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 1342 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:39,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 313 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-05 16:39:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 366. [2025-02-05 16:39:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 355 states have (on average 1.3577464788732394) internal successors, (482), 365 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:39,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 482 transitions. [2025-02-05 16:39:39,630 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 482 transitions. Word has length 60 [2025-02-05 16:39:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 482 transitions. [2025-02-05 16:39:39,630 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:39:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 482 transitions. [2025-02-05 16:39:39,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:39:39,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:39,632 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:39:39,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:39:39,632 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:39:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1715255438, now seen corresponding path program 1 times [2025-02-05 16:39:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909051538] [2025-02-05 16:39:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:39,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:39:39,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:39:39,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:39,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:39,750 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:39:39,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909051538] [2025-02-05 16:39:39,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909051538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:39,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:39,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:39,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132828243] [2025-02-05 16:39:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:39,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:39,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:39,752 INFO L87 Difference]: Start difference. First operand 366 states and 482 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:39:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:39,897 INFO L93 Difference]: Finished difference Result 661 states and 890 transitions. [2025-02-05 16:39:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:39,897 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:39:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:39,899 INFO L225 Difference]: With dead ends: 661 [2025-02-05 16:39:39,899 INFO L226 Difference]: Without dead ends: 347 [2025-02-05 16:39:39,900 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:39:39,900 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 913 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:39,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 199 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-05 16:39:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-02-05 16:39:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 336 states have (on average 1.3660714285714286) internal successors, (459), 346 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 459 transitions. [2025-02-05 16:39:39,909 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 459 transitions. Word has length 61 [2025-02-05 16:39:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:39,909 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 459 transitions. [2025-02-05 16:39:39,909 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:39:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 459 transitions. [2025-02-05 16:39:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:39:39,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:39,910 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:39:39,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:39:39,910 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:39:39,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:39,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1987134437, now seen corresponding path program 1 times [2025-02-05 16:39:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765239238] [2025-02-05 16:39:39,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:39,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:39,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:39:39,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:39:39,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:39,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:40,025 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:39:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765239238] [2025-02-05 16:39:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765239238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581354359] [2025-02-05 16:39:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:40,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:40,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:40,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:40,029 INFO L87 Difference]: Start difference. First operand 347 states and 459 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:40,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:40,177 INFO L93 Difference]: Finished difference Result 642 states and 865 transitions. [2025-02-05 16:39:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 16:39:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:40,182 INFO L225 Difference]: With dead ends: 642 [2025-02-05 16:39:40,182 INFO L226 Difference]: Without dead ends: 339 [2025-02-05 16:39:40,182 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:39:40,183 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 870 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:40,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 195 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-05 16:39:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-02-05 16:39:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 338 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:39:40,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 448 transitions. [2025-02-05 16:39:40,195 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 448 transitions. Word has length 62 [2025-02-05 16:39:40,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:40,195 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 448 transitions. [2025-02-05 16:39:40,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:40,195 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 448 transitions. [2025-02-05 16:39:40,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:39:40,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:40,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:40,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:39:40,197 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:39:40,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash -213127066, now seen corresponding path program 1 times [2025-02-05 16:39:40,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:40,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056544987] [2025-02-05 16:39:40,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:39:40,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:39:40,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:40,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:40,702 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:39:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:40,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056544987] [2025-02-05 16:39:40,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056544987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:40,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:40,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:39:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479897487] [2025-02-05 16:39:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:40,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:39:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:40,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:39:40,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:39:40,708 INFO L87 Difference]: Start difference. First operand 339 states and 448 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:41,112 INFO L93 Difference]: Finished difference Result 689 states and 913 transitions. [2025-02-05 16:39:41,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:39:41,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:39:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:41,114 INFO L225 Difference]: With dead ends: 689 [2025-02-05 16:39:41,114 INFO L226 Difference]: Without dead ends: 504 [2025-02-05 16:39:41,115 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:39:41,115 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1287 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:41,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 758 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-02-05 16:39:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 339. [2025-02-05 16:39:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 338 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:39:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 447 transitions. [2025-02-05 16:39:41,127 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 447 transitions. Word has length 63 [2025-02-05 16:39:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:41,128 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 447 transitions. [2025-02-05 16:39:41,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 447 transitions. [2025-02-05 16:39:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:39:41,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:41,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:41,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:39:41,130 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:39:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -633020883, now seen corresponding path program 1 times [2025-02-05 16:39:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:41,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87675706] [2025-02-05 16:39:41,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:41,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:41,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:39:41,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:39:41,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:41,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:41,387 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:39:41,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:41,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87675706] [2025-02-05 16:39:41,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87675706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:41,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:41,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:41,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853818874] [2025-02-05 16:39:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:41,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:41,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:41,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:41,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:41,388 INFO L87 Difference]: Start difference. First operand 339 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:41,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:41,809 INFO L93 Difference]: Finished difference Result 537 states and 730 transitions. [2025-02-05 16:39:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:41,810 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:39:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:41,812 INFO L225 Difference]: With dead ends: 537 [2025-02-05 16:39:41,812 INFO L226 Difference]: Without dead ends: 397 [2025-02-05 16:39:41,812 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:39:41,813 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1029 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:41,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 995 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:41,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-05 16:39:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 339. [2025-02-05 16:39:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 338 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:39:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 446 transitions. [2025-02-05 16:39:41,819 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 446 transitions. Word has length 63 [2025-02-05 16:39:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:41,819 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 446 transitions. [2025-02-05 16:39:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 446 transitions. [2025-02-05 16:39:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:39:41,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:41,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:41,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:39:41,820 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:39:41,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash -406599686, now seen corresponding path program 1 times [2025-02-05 16:39:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:41,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141578608] [2025-02-05 16:39:41,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:41,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:41,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:39:41,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:39:41,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:41,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:42,021 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:39:42,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:42,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141578608] [2025-02-05 16:39:42,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141578608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:42,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:42,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:42,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364144083] [2025-02-05 16:39:42,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:42,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:42,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:42,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:42,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:42,023 INFO L87 Difference]: Start difference. First operand 339 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:42,427 INFO L93 Difference]: Finished difference Result 535 states and 703 transitions. [2025-02-05 16:39:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:42,427 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:39:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:42,429 INFO L225 Difference]: With dead ends: 535 [2025-02-05 16:39:42,429 INFO L226 Difference]: Without dead ends: 530 [2025-02-05 16:39:42,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:39:42,430 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 979 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:42,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 742 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-02-05 16:39:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 339. [2025-02-05 16:39:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.3567073170731707) internal successors, (445), 338 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:42,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 445 transitions. [2025-02-05 16:39:42,437 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 445 transitions. Word has length 63 [2025-02-05 16:39:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 445 transitions. [2025-02-05 16:39:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 445 transitions. [2025-02-05 16:39:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:42,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:42,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:42,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:39:42,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash 323489165, now seen corresponding path program 1 times [2025-02-05 16:39:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621724657] [2025-02-05 16:39:42,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:42,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:42,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:42,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:42,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:42,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:39:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621724657] [2025-02-05 16:39:42,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621724657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:42,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:42,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:39:42,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032558261] [2025-02-05 16:39:42,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:42,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:39:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:42,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:39:42,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:39:42,826 INFO L87 Difference]: Start difference. First operand 339 states and 445 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:43,834 INFO L93 Difference]: Finished difference Result 1033 states and 1438 transitions. [2025-02-05 16:39:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:39:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:43,837 INFO L225 Difference]: With dead ends: 1033 [2025-02-05 16:39:43,837 INFO L226 Difference]: Without dead ends: 910 [2025-02-05 16:39:43,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:39:43,844 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 2845 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2845 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:43,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2845 Valid, 1331 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:39:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-02-05 16:39:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 343. [2025-02-05 16:39:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3524096385542168) internal successors, (449), 342 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:39:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 449 transitions. [2025-02-05 16:39:43,862 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 449 transitions. Word has length 65 [2025-02-05 16:39:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:43,862 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 449 transitions. [2025-02-05 16:39:43,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 449 transitions. [2025-02-05 16:39:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:43,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:43,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:39:43,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1910527089, now seen corresponding path program 1 times [2025-02-05 16:39:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995338616] [2025-02-05 16:39:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:43,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:43,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:43,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:44,103 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:39:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995338616] [2025-02-05 16:39:44,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995338616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:44,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:44,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935518369] [2025-02-05 16:39:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:44,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:44,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:44,105 INFO L87 Difference]: Start difference. First operand 343 states and 449 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:44,477 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2025-02-05 16:39:44,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:44,479 INFO L225 Difference]: With dead ends: 645 [2025-02-05 16:39:44,479 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 16:39:44,479 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:39:44,480 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1717 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:44,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 745 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 16:39:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-02-05 16:39:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3493975903614457) internal successors, (448), 342 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:39:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 448 transitions. [2025-02-05 16:39:44,487 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 448 transitions. Word has length 65 [2025-02-05 16:39:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:44,487 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 448 transitions. [2025-02-05 16:39:44,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 448 transitions. [2025-02-05 16:39:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:44,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:44,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:44,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:39:44,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:44,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -71533182, now seen corresponding path program 1 times [2025-02-05 16:39:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:44,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114557036] [2025-02-05 16:39:44,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:44,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:44,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:44,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:44,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:44,692 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:39:44,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:44,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114557036] [2025-02-05 16:39:44,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114557036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:44,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:44,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:44,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074885031] [2025-02-05 16:39:44,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:44,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:44,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:44,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:44,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:44,694 INFO L87 Difference]: Start difference. First operand 343 states and 448 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:45,056 INFO L93 Difference]: Finished difference Result 642 states and 860 transitions. [2025-02-05 16:39:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:45,059 INFO L225 Difference]: With dead ends: 642 [2025-02-05 16:39:45,059 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 16:39:45,059 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:39:45,060 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 1714 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:45,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 745 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:45,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 16:39:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-02-05 16:39:45,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3463855421686748) internal successors, (447), 342 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:39:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 447 transitions. [2025-02-05 16:39:45,067 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 447 transitions. Word has length 65 [2025-02-05 16:39:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:45,067 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 447 transitions. [2025-02-05 16:39:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 447 transitions. [2025-02-05 16:39:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:45,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:45,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:45,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:39:45,069 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:39:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1047366714, now seen corresponding path program 1 times [2025-02-05 16:39:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499248670] [2025-02-05 16:39:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:45,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:45,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:45,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:45,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:45,271 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:39:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499248670] [2025-02-05 16:39:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499248670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:45,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:45,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:45,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157026658] [2025-02-05 16:39:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:45,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:45,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:45,273 INFO L87 Difference]: Start difference. First operand 343 states and 447 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:45,689 INFO L93 Difference]: Finished difference Result 668 states and 900 transitions. [2025-02-05 16:39:45,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:45,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:45,691 INFO L225 Difference]: With dead ends: 668 [2025-02-05 16:39:45,691 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 16:39:45,691 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:39:45,692 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1374 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:45,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 1053 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:45,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 16:39:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 343. [2025-02-05 16:39:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3433734939759037) internal successors, (446), 342 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:39:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 446 transitions. [2025-02-05 16:39:45,699 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 446 transitions. Word has length 65 [2025-02-05 16:39:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:45,699 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 446 transitions. [2025-02-05 16:39:45,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 446 transitions. [2025-02-05 16:39:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:45,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:45,700 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:45,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:39:45,700 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:45,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1530236826, now seen corresponding path program 1 times [2025-02-05 16:39:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:45,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600224093] [2025-02-05 16:39:45,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:45,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:45,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:45,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:45,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600224093] [2025-02-05 16:39:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600224093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:45,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777893918] [2025-02-05 16:39:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:45,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:45,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:45,877 INFO L87 Difference]: Start difference. First operand 343 states and 446 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:46,244 INFO L93 Difference]: Finished difference Result 571 states and 768 transitions. [2025-02-05 16:39:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:46,245 INFO L225 Difference]: With dead ends: 571 [2025-02-05 16:39:46,245 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 16:39:46,246 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:39:46,246 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1340 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:46,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 773 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 16:39:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 343. [2025-02-05 16:39:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3373493975903614) internal successors, (444), 342 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:39:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 444 transitions. [2025-02-05 16:39:46,252 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 444 transitions. Word has length 65 [2025-02-05 16:39:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:46,253 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 444 transitions. [2025-02-05 16:39:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 444 transitions. [2025-02-05 16:39:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:46,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:46,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:46,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:39:46,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:46,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -900054424, now seen corresponding path program 1 times [2025-02-05 16:39:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298905092] [2025-02-05 16:39:46,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:46,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:46,455 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:39:46,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298905092] [2025-02-05 16:39:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298905092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:46,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:46,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944777105] [2025-02-05 16:39:46,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:46,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:46,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:46,456 INFO L87 Difference]: Start difference. First operand 343 states and 444 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:46,884 INFO L93 Difference]: Finished difference Result 567 states and 744 transitions. [2025-02-05 16:39:46,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:46,886 INFO L225 Difference]: With dead ends: 567 [2025-02-05 16:39:46,886 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 16:39:46,886 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:39:46,887 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1316 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:46,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 1177 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 16:39:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 343. [2025-02-05 16:39:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3313253012048192) internal successors, (442), 342 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:39:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 442 transitions. [2025-02-05 16:39:46,894 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 442 transitions. Word has length 65 [2025-02-05 16:39:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 442 transitions. [2025-02-05 16:39:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 442 transitions. [2025-02-05 16:39:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:39:46,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:46,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:46,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:39:46,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:46,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1160896618, now seen corresponding path program 1 times [2025-02-05 16:39:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118992861] [2025-02-05 16:39:46,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:46,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:39:46,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:39:46,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:46,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:47,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:47,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118992861] [2025-02-05 16:39:47,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118992861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:47,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:47,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:47,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573032341] [2025-02-05 16:39:47,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:47,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:47,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:47,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:47,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:47,072 INFO L87 Difference]: Start difference. First operand 343 states and 442 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:47,442 INFO L93 Difference]: Finished difference Result 539 states and 698 transitions. [2025-02-05 16:39:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:47,442 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:47,444 INFO L225 Difference]: With dead ends: 539 [2025-02-05 16:39:47,444 INFO L226 Difference]: Without dead ends: 534 [2025-02-05 16:39:47,444 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:39:47,445 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1177 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 825 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:39:47,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 825 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-05 16:39:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 343. [2025-02-05 16:39:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 332 states have (on average 1.3253012048192772) internal successors, (440), 342 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:39:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 440 transitions. [2025-02-05 16:39:47,453 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 440 transitions. Word has length 65 [2025-02-05 16:39:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:47,454 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 440 transitions. [2025-02-05 16:39:47,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 440 transitions. [2025-02-05 16:39:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:39:47,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:47,455 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:39:47,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:39:47,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:47,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:47,455 INFO L85 PathProgramCache]: Analyzing trace with hash 124098183, now seen corresponding path program 1 times [2025-02-05 16:39:47,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:47,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141987394] [2025-02-05 16:39:47,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:47,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:47,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:39:47,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:39:47,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:47,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:47,591 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:39:47,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141987394] [2025-02-05 16:39:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141987394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:47,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125196557] [2025-02-05 16:39:47,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:47,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:47,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:47,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:47,592 INFO L87 Difference]: Start difference. First operand 343 states and 440 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:48,004 INFO L93 Difference]: Finished difference Result 673 states and 899 transitions. [2025-02-05 16:39:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:39:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:48,006 INFO L225 Difference]: With dead ends: 673 [2025-02-05 16:39:48,006 INFO L226 Difference]: Without dead ends: 550 [2025-02-05 16:39:48,008 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:39:48,008 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 920 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:48,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1115 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-02-05 16:39:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 339. [2025-02-05 16:39:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 328 states have (on average 1.326219512195122) internal successors, (435), 338 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 435 transitions. [2025-02-05 16:39:48,016 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 435 transitions. Word has length 66 [2025-02-05 16:39:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:48,016 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 435 transitions. [2025-02-05 16:39:48,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 435 transitions. [2025-02-05 16:39:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:48,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:48,017 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:39:48,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:39:48,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1381566483, now seen corresponding path program 1 times [2025-02-05 16:39:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:48,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838009802] [2025-02-05 16:39:48,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:48,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:48,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:48,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:48,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:48,333 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:39:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:48,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838009802] [2025-02-05 16:39:48,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838009802] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:48,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:48,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:39:48,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149041998] [2025-02-05 16:39:48,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:48,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:39:48,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:48,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:39:48,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:39:48,336 INFO L87 Difference]: Start difference. First operand 339 states and 435 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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:39:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:48,618 INFO L93 Difference]: Finished difference Result 587 states and 784 transitions. [2025-02-05 16:39:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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:39:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:48,620 INFO L225 Difference]: With dead ends: 587 [2025-02-05 16:39:48,620 INFO L226 Difference]: Without dead ends: 418 [2025-02-05 16:39:48,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-05 16:39:48,622 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 868 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:48,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 821 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-02-05 16:39:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2025-02-05 16:39:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.3308550185873607) internal successors, (358), 275 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 358 transitions. [2025-02-05 16:39:48,628 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 358 transitions. Word has length 67 [2025-02-05 16:39:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:48,628 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 358 transitions. [2025-02-05 16:39:48,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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:39:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 358 transitions. [2025-02-05 16:39:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:48,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:48,629 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:48,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:39:48,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:48,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash 141847688, now seen corresponding path program 1 times [2025-02-05 16:39:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345304135] [2025-02-05 16:39:48,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:48,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:48,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:48,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:48,988 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:39:48,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:48,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345304135] [2025-02-05 16:39:48,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345304135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:48,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:48,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:39:48,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078067256] [2025-02-05 16:39:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:48,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:39:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:48,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:39:48,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:39:48,990 INFO L87 Difference]: Start difference. First operand 276 states and 358 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:39:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:49,377 INFO L93 Difference]: Finished difference Result 554 states and 757 transitions. [2025-02-05 16:39:49,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:49,377 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:39:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:49,378 INFO L225 Difference]: With dead ends: 554 [2025-02-05 16:39:49,378 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 16:39:49,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:39:49,379 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 794 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:49,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1465 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 16:39:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 256. [2025-02-05 16:39:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 250 states have (on average 1.328) internal successors, (332), 255 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 332 transitions. [2025-02-05 16:39:49,384 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 332 transitions. Word has length 67 [2025-02-05 16:39:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 332 transitions. [2025-02-05 16:39:49,385 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:39:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 332 transitions. [2025-02-05 16:39:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:49,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:49,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:49,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:39:49,385 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -385919704, now seen corresponding path program 1 times [2025-02-05 16:39:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:49,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696406481] [2025-02-05 16:39:49,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:49,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:49,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:49,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:49,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:49,796 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:39:49,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696406481] [2025-02-05 16:39:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696406481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:49,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:49,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:39:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234060419] [2025-02-05 16:39:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:49,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:39:49,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:49,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:39:49,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:39:49,798 INFO L87 Difference]: Start difference. First operand 256 states and 332 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:50,353 INFO L93 Difference]: Finished difference Result 672 states and 908 transitions. [2025-02-05 16:39:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:39:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:39:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:50,355 INFO L225 Difference]: With dead ends: 672 [2025-02-05 16:39:50,355 INFO L226 Difference]: Without dead ends: 668 [2025-02-05 16:39:50,355 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:39:50,356 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1249 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:50,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 1246 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-02-05 16:39:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 252. [2025-02-05 16:39:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.3279352226720649) internal successors, (328), 251 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 328 transitions. [2025-02-05 16:39:50,361 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 328 transitions. Word has length 67 [2025-02-05 16:39:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:50,362 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 328 transitions. [2025-02-05 16:39:50,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 328 transitions. [2025-02-05 16:39:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:50,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:50,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:50,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:39:50,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1763550170, now seen corresponding path program 1 times [2025-02-05 16:39:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:50,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947004544] [2025-02-05 16:39:50,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:50,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:50,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:50,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:50,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:50,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:50,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947004544] [2025-02-05 16:39:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947004544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:39:50,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218155958] [2025-02-05 16:39:50,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:50,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:39:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:50,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:39:50,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:39:50,779 INFO L87 Difference]: Start difference. First operand 252 states and 328 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:51,373 INFO L93 Difference]: Finished difference Result 774 states and 1061 transitions. [2025-02-05 16:39:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:39:51,373 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:39:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:51,375 INFO L225 Difference]: With dead ends: 774 [2025-02-05 16:39:51,375 INFO L226 Difference]: Without dead ends: 662 [2025-02-05 16:39:51,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:39:51,376 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1026 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:51,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1567 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-02-05 16:39:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 242. [2025-02-05 16:39:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.315126050420168) internal successors, (313), 241 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 313 transitions. [2025-02-05 16:39:51,382 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 313 transitions. Word has length 67 [2025-02-05 16:39:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 313 transitions. [2025-02-05 16:39:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 313 transitions. [2025-02-05 16:39:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:39:51,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:51,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:51,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:39:51,383 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:51,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:51,384 INFO L85 PathProgramCache]: Analyzing trace with hash -497690943, now seen corresponding path program 1 times [2025-02-05 16:39:51,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:51,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130250560] [2025-02-05 16:39:51,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:51,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:51,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:39:51,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:39:51,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:51,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:51,511 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:39:51,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:51,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130250560] [2025-02-05 16:39:51,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130250560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:51,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061424254] [2025-02-05 16:39:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:51,513 INFO L87 Difference]: Start difference. First operand 242 states and 313 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:51,770 INFO L93 Difference]: Finished difference Result 405 states and 533 transitions. [2025-02-05 16:39:51,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:51,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:39:51,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:51,772 INFO L225 Difference]: With dead ends: 405 [2025-02-05 16:39:51,772 INFO L226 Difference]: Without dead ends: 398 [2025-02-05 16:39:51,772 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:39:51,773 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 521 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:51,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 516 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:51,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-02-05 16:39:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 242. [2025-02-05 16:39:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.3109243697478992) internal successors, (312), 241 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 312 transitions. [2025-02-05 16:39:51,779 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 312 transitions. Word has length 68 [2025-02-05 16:39:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:51,779 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 312 transitions. [2025-02-05 16:39:51,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:51,780 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 312 transitions. [2025-02-05 16:39:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:39:51,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:51,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:39:51,780 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:51,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -578655993, now seen corresponding path program 1 times [2025-02-05 16:39:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697307534] [2025-02-05 16:39:51,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:51,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:39:51,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:39:51,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:51,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:52,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:39:52,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:52,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697307534] [2025-02-05 16:39:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697307534] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:39:52,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210032780] [2025-02-05 16:39:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:52,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:39:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:52,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:39:52,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:39:52,025 INFO L87 Difference]: Start difference. First operand 242 states and 312 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,575 INFO L93 Difference]: Finished difference Result 904 states and 1263 transitions. [2025-02-05 16:39:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:39:52,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:39:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,577 INFO L225 Difference]: With dead ends: 904 [2025-02-05 16:39:52,577 INFO L226 Difference]: Without dead ends: 768 [2025-02-05 16:39:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:39:52,578 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 2684 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2684 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:52,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2684 Valid, 753 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:39:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-05 16:39:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 250. [2025-02-05 16:39:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 249 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2025-02-05 16:39:52,584 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 68 [2025-02-05 16:39:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2025-02-05 16:39:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2025-02-05 16:39:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:39:52,585 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:39:52,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -254562487, now seen corresponding path program 1 times [2025-02-05 16:39:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203394351] [2025-02-05 16:39:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:39:52,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:39:52,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:52,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203394351] [2025-02-05 16:39:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203394351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262286557] [2025-02-05 16:39:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:52,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:52,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:52,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:52,718 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:52,974 INFO L93 Difference]: Finished difference Result 413 states and 539 transitions. [2025-02-05 16:39:52,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:39:52,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:39:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:52,975 INFO L225 Difference]: With dead ends: 413 [2025-02-05 16:39:52,975 INFO L226 Difference]: Without dead ends: 406 [2025-02-05 16:39:52,978 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:39:52,980 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1107 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:52,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 531 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-02-05 16:39:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 250. [2025-02-05 16:39:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 246 states have (on average 1.2967479674796747) internal successors, (319), 249 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 319 transitions. [2025-02-05 16:39:52,984 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 319 transitions. Word has length 68 [2025-02-05 16:39:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:52,984 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 319 transitions. [2025-02-05 16:39:52,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 319 transitions. [2025-02-05 16:39:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:39:52,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:52,985 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:39:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:39:52,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:52,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1345860024, now seen corresponding path program 1 times [2025-02-05 16:39:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090511614] [2025-02-05 16:39:52,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:52,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:39:53,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:39:53,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:53,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:53,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090511614] [2025-02-05 16:39:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090511614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:39:53,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502273531] [2025-02-05 16:39:53,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:39:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:39:53,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:39:53,124 INFO L87 Difference]: Start difference. First operand 250 states and 319 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:53,434 INFO L93 Difference]: Finished difference Result 544 states and 731 transitions. [2025-02-05 16:39:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:53,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:39:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:53,436 INFO L225 Difference]: With dead ends: 544 [2025-02-05 16:39:53,436 INFO L226 Difference]: Without dead ends: 408 [2025-02-05 16:39:53,436 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:39:53,437 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 767 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:53,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 778 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-02-05 16:39:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 242. [2025-02-05 16:39:53,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 238 states have (on average 1.2983193277310925) internal successors, (309), 241 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 309 transitions. [2025-02-05 16:39:53,441 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 309 transitions. Word has length 69 [2025-02-05 16:39:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 309 transitions. [2025-02-05 16:39:53,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 309 transitions. [2025-02-05 16:39:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:53,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:53,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:53,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:39:53,442 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:53,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1347004063, now seen corresponding path program 1 times [2025-02-05 16:39:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323375129] [2025-02-05 16:39:53,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:53,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:53,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:53,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:53,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:53,751 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:39:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323375129] [2025-02-05 16:39:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323375129] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:39:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556721818] [2025-02-05 16:39:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:53,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:39:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:53,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:39:53,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:39:53,752 INFO L87 Difference]: Start difference. First operand 242 states and 309 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:54,122 INFO L93 Difference]: Finished difference Result 404 states and 532 transitions. [2025-02-05 16:39:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:39:54,123 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:39:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:54,124 INFO L225 Difference]: With dead ends: 404 [2025-02-05 16:39:54,124 INFO L226 Difference]: Without dead ends: 386 [2025-02-05 16:39:54,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:39:54,124 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 453 mSDsluCounter, 1906 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:54,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 2178 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-02-05 16:39:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 224. [2025-02-05 16:39:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 221 states have (on average 1.3031674208144797) internal successors, (288), 223 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2025-02-05 16:39:54,128 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 70 [2025-02-05 16:39:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2025-02-05 16:39:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2025-02-05 16:39:54,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:54,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:54,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:39:54,129 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:54,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2059714215, now seen corresponding path program 1 times [2025-02-05 16:39:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023708280] [2025-02-05 16:39:54,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:54,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:54,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:54,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:54,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:54,453 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:39:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023708280] [2025-02-05 16:39:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023708280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:54,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:39:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598837326] [2025-02-05 16:39:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:54,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:39:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:54,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:39:54,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:39:54,455 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:54,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:55,000 INFO L93 Difference]: Finished difference Result 604 states and 829 transitions. [2025-02-05 16:39:55,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:39:55,000 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:39:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:55,002 INFO L225 Difference]: With dead ends: 604 [2025-02-05 16:39:55,002 INFO L226 Difference]: Without dead ends: 598 [2025-02-05 16:39:55,002 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:39:55,003 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 856 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:55,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1511 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:39:55,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2025-02-05 16:39:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 218. [2025-02-05 16:39:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 216 states have (on average 1.3009259259259258) internal successors, (281), 217 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2025-02-05 16:39:55,006 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 70 [2025-02-05 16:39:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:55,007 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2025-02-05 16:39:55,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2025-02-05 16:39:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:39:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:55,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:39:55,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 371206313, now seen corresponding path program 1 times [2025-02-05 16:39:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592679948] [2025-02-05 16:39:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:55,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:39:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:39:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:55,848 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:39:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592679948] [2025-02-05 16:39:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592679948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-05 16:39:55,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908521374] [2025-02-05 16:39:55,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:55,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:39:55,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:55,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:39:55,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:39:55,852 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:56,909 INFO L93 Difference]: Finished difference Result 236 states and 301 transitions. [2025-02-05 16:39:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:39:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-05 16:39:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:56,910 INFO L225 Difference]: With dead ends: 236 [2025-02-05 16:39:56,910 INFO L226 Difference]: Without dead ends: 228 [2025-02-05 16:39:56,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 16:39:56,911 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 435 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:56,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1609 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:39:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-05 16:39:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2025-02-05 16:39:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 1.2977777777777777) internal successors, (292), 226 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 292 transitions. [2025-02-05 16:39:56,915 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 292 transitions. Word has length 70 [2025-02-05 16:39:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:56,915 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 292 transitions. [2025-02-05 16:39:56,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 292 transitions. [2025-02-05 16:39:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:39:56,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:56,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:56,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:39:56,917 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:39:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1515694186, now seen corresponding path program 1 times [2025-02-05 16:39:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001767809] [2025-02-05 16:39:56,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:56,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:39:56,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:39:56,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:56,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:57,184 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:39:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001767809] [2025-02-05 16:39:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001767809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:39:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549299144] [2025-02-05 16:39:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:57,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:39:57,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:57,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:39:57,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:39:57,186 INFO L87 Difference]: Start difference. First operand 227 states and 292 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:57,539 INFO L93 Difference]: Finished difference Result 365 states and 488 transitions. [2025-02-05 16:39:57,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:39:57,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:39:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:57,540 INFO L225 Difference]: With dead ends: 365 [2025-02-05 16:39:57,540 INFO L226 Difference]: Without dead ends: 350 [2025-02-05 16:39:57,540 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:39:57,541 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 712 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:57,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1242 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-05 16:39:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 206. [2025-02-05 16:39:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.302439024390244) internal successors, (267), 205 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 267 transitions. [2025-02-05 16:39:57,546 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 267 transitions. Word has length 71 [2025-02-05 16:39:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 267 transitions. [2025-02-05 16:39:57,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,547 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 267 transitions. [2025-02-05 16:39:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:39:57,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:57,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:57,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:39:57,548 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:39:57,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1709352252, now seen corresponding path program 1 times [2025-02-05 16:39:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655738283] [2025-02-05 16:39:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:39:57,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:39:57,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:57,619 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:39:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:57,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655738283] [2025-02-05 16:39:57,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655738283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:57,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80073299] [2025-02-05 16:39:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:57,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:57,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:57,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:57,621 INFO L87 Difference]: Start difference. First operand 206 states and 267 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:57,718 INFO L93 Difference]: Finished difference Result 1054 states and 1531 transitions. [2025-02-05 16:39:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:39:57,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:39:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:57,722 INFO L225 Difference]: With dead ends: 1054 [2025-02-05 16:39:57,722 INFO L226 Difference]: Without dead ends: 948 [2025-02-05 16:39:57,722 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:39:57,723 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 774 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:57,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1336 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-02-05 16:39:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 310. [2025-02-05 16:39:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2025-02-05 16:39:57,731 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 93 [2025-02-05 16:39:57,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:57,731 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2025-02-05 16:39:57,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,731 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2025-02-05 16:39:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:57,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:57,732 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:39:57,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:39:57,732 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:39:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash -747684288, now seen corresponding path program 1 times [2025-02-05 16:39:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:57,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299583659] [2025-02-05 16:39:57,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:57,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:57,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:57,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:57,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:57,817 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:39:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299583659] [2025-02-05 16:39:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299583659] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832328247] [2025-02-05 16:39:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:57,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:57,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:57,819 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:57,885 INFO L93 Difference]: Finished difference Result 1256 states and 1818 transitions. [2025-02-05 16:39:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:39:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:57,888 INFO L225 Difference]: With dead ends: 1256 [2025-02-05 16:39:57,888 INFO L226 Difference]: Without dead ends: 1046 [2025-02-05 16:39:57,888 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:39:57,888 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 579 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:57,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 823 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:57,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-02-05 16:39:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 518. [2025-02-05 16:39:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.4081237911025144) internal successors, (728), 517 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 728 transitions. [2025-02-05 16:39:57,898 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 728 transitions. Word has length 95 [2025-02-05 16:39:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:57,898 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 728 transitions. [2025-02-05 16:39:57,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 728 transitions. [2025-02-05 16:39:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:57,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:57,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, 1, 1, 1, 1, 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:39:57,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:39:57,900 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:39:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -884037152, now seen corresponding path program 1 times [2025-02-05 16:39:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:57,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910346779] [2025-02-05 16:39:57,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:57,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:57,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:57,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:57,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910346779] [2025-02-05 16:39:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910346779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:57,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:57,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154294220] [2025-02-05 16:39:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:57,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:57,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:57,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:57,983 INFO L87 Difference]: Start difference. First operand 518 states and 728 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,047 INFO L93 Difference]: Finished difference Result 1464 states and 2126 transitions. [2025-02-05 16:39:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:39:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,050 INFO L225 Difference]: With dead ends: 1464 [2025-02-05 16:39:58,050 INFO L226 Difference]: Without dead ends: 1254 [2025-02-05 16:39:58,051 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:39:58,051 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 579 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:58,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 771 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-02-05 16:39:58,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 830. [2025-02-05 16:39:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4342581423401688) internal successors, (1189), 829 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1189 transitions. [2025-02-05 16:39:58,062 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1189 transitions. Word has length 95 [2025-02-05 16:39:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,062 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1189 transitions. [2025-02-05 16:39:58,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1189 transitions. [2025-02-05 16:39:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:58,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,063 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:39:58,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:39:58,063 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:39:58,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1039459712, now seen corresponding path program 1 times [2025-02-05 16:39:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213879499] [2025-02-05 16:39:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:58,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:58,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,135 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:39:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213879499] [2025-02-05 16:39:58,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213879499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757828406] [2025-02-05 16:39:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:58,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:58,136 INFO L87 Difference]: Start difference. First operand 830 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,207 INFO L93 Difference]: Finished difference Result 1672 states and 2434 transitions. [2025-02-05 16:39:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:58,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:39:58,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,212 INFO L225 Difference]: With dead ends: 1672 [2025-02-05 16:39:58,212 INFO L226 Difference]: Without dead ends: 1462 [2025-02-05 16:39:58,212 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:39:58,213 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 625 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:58,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 747 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:58,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-02-05 16:39:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1038. [2025-02-05 16:39:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.4435872709739634) internal successors, (1497), 1037 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1497 transitions. [2025-02-05 16:39:58,226 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1497 transitions. Word has length 95 [2025-02-05 16:39:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,226 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1497 transitions. [2025-02-05 16:39:58,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1497 transitions. [2025-02-05 16:39:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:58,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:58,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:39:58,227 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:39:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash -769620734, now seen corresponding path program 1 times [2025-02-05 16:39:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451927625] [2025-02-05 16:39:58,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:58,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:58,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,378 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:39:58,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451927625] [2025-02-05 16:39:58,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451927625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741155089] [2025-02-05 16:39:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:58,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:58,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:58,379 INFO L87 Difference]: Start difference. First operand 1038 states and 1497 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,479 INFO L93 Difference]: Finished difference Result 1978 states and 2886 transitions. [2025-02-05 16:39:58,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:58,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:39:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,485 INFO L225 Difference]: With dead ends: 1978 [2025-02-05 16:39:58,485 INFO L226 Difference]: Without dead ends: 1040 [2025-02-05 16:39:58,486 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:39:58,486 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 201 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:58,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 378 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:58,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2025-02-05 16:39:58,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1038. [2025-02-05 16:39:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 1.433944069431051) internal successors, (1487), 1037 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1487 transitions. [2025-02-05 16:39:58,497 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1487 transitions. Word has length 95 [2025-02-05 16:39:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,498 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1487 transitions. [2025-02-05 16:39:58,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1487 transitions. [2025-02-05 16:39:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:58,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,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, 1, 1, 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:39:58,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:39:58,499 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:39:58,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,499 INFO L85 PathProgramCache]: Analyzing trace with hash -805638053, now seen corresponding path program 1 times [2025-02-05 16:39:58,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610614232] [2025-02-05 16:39:58,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:58,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:58,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,530 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:39:58,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610614232] [2025-02-05 16:39:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610614232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:58,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960898720] [2025-02-05 16:39:58,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:58,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:58,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:58,532 INFO L87 Difference]: Start difference. First operand 1038 states and 1487 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:39:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,553 INFO L93 Difference]: Finished difference Result 2798 states and 4049 transitions. [2025-02-05 16:39:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:58,553 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:39:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,557 INFO L225 Difference]: With dead ends: 2798 [2025-02-05 16:39:58,557 INFO L226 Difference]: Without dead ends: 1860 [2025-02-05 16:39:58,558 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:39:58,559 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:58,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 368 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-02-05 16:39:58,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1858. [2025-02-05 16:39:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.4184168012924072) internal successors, (2634), 1857 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2634 transitions. [2025-02-05 16:39:58,577 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2634 transitions. Word has length 95 [2025-02-05 16:39:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,577 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2634 transitions. [2025-02-05 16:39:58,577 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:39:58,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2634 transitions. [2025-02-05 16:39:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:39:58,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,578 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:39:58,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:39:58,578 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:39:58,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1085673184, now seen corresponding path program 1 times [2025-02-05 16:39:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130947709] [2025-02-05 16:39:58,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:39:58,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:39:58,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,668 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:39:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130947709] [2025-02-05 16:39:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130947709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655444235] [2025-02-05 16:39:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:58,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:58,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:58,669 INFO L87 Difference]: Start difference. First operand 1858 states and 2634 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,745 INFO L93 Difference]: Finished difference Result 3428 states and 4895 transitions. [2025-02-05 16:39:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:58,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:39:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,752 INFO L225 Difference]: With dead ends: 3428 [2025-02-05 16:39:58,752 INFO L226 Difference]: Without dead ends: 3036 [2025-02-05 16:39:58,753 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:39:58,753 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 587 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:58,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 812 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-02-05 16:39:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2248. [2025-02-05 16:39:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 2247 states have (on average 1.4214508233199823) internal successors, (3194), 2247 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3194 transitions. [2025-02-05 16:39:58,776 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3194 transitions. Word has length 95 [2025-02-05 16:39:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3194 transitions. [2025-02-05 16:39:58,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3194 transitions. [2025-02-05 16:39:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:39:58,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,777 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:39:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:39:58,777 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:39:58,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1941145606, now seen corresponding path program 1 times [2025-02-05 16:39:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404863440] [2025-02-05 16:39:58,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:39:58,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:39:58,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,833 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:39:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404863440] [2025-02-05 16:39:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404863440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:58,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339501023] [2025-02-05 16:39:58,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:58,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:58,834 INFO L87 Difference]: Start difference. First operand 2248 states and 3194 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:39:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:58,855 INFO L93 Difference]: Finished difference Result 5708 states and 8130 transitions. [2025-02-05 16:39:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:58,855 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:39:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:58,867 INFO L225 Difference]: With dead ends: 5708 [2025-02-05 16:39:58,867 INFO L226 Difference]: Without dead ends: 3560 [2025-02-05 16:39:58,870 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:39:58,870 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 78 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 343 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:39:58,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-02-05 16:39:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3382. [2025-02-05 16:39:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3382 states, 3381 states have (on average 1.4072759538598048) internal successors, (4758), 3381 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4758 transitions. [2025-02-05 16:39:58,914 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4758 transitions. Word has length 96 [2025-02-05 16:39:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:58,914 INFO L471 AbstractCegarLoop]: Abstraction has 3382 states and 4758 transitions. [2025-02-05 16:39:58,914 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:39:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4758 transitions. [2025-02-05 16:39:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:39:58,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:58,915 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:39:58,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:39:58,915 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:39:58,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:58,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1630603392, now seen corresponding path program 1 times [2025-02-05 16:39:58,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:58,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23623516] [2025-02-05 16:39:58,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:58,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:58,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:39:58,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:39:58,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:58,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:58,978 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:39:58,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:58,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23623516] [2025-02-05 16:39:58,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23623516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:58,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:58,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:58,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150295953] [2025-02-05 16:39:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:58,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:58,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:58,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:58,980 INFO L87 Difference]: Start difference. First operand 3382 states and 4758 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:39:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,007 INFO L93 Difference]: Finished difference Result 9682 states and 13594 transitions. [2025-02-05 16:39:59,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:59,007 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:39:59,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,017 INFO L225 Difference]: With dead ends: 9682 [2025-02-05 16:39:59,017 INFO L226 Difference]: Without dead ends: 6400 [2025-02-05 16:39:59,022 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:39:59,022 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 71 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 343 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:39:59,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 343 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6400 states. [2025-02-05 16:39:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6400 to 6134. [2025-02-05 16:39:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.393771400619599) internal successors, (8548), 6133 states have internal predecessors, (8548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 8548 transitions. [2025-02-05 16:39:59,075 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 8548 transitions. Word has length 97 [2025-02-05 16:39:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:59,075 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 8548 transitions. [2025-02-05 16:39:59,075 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:39:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 8548 transitions. [2025-02-05 16:39:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:39:59,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,076 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:39:59,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:39:59,076 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:39:59,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -251076935, now seen corresponding path program 1 times [2025-02-05 16:39:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604052975] [2025-02-05 16:39:59,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:39:59,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:39:59,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,135 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:39:59,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604052975] [2025-02-05 16:39:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604052975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341892640] [2025-02-05 16:39:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:59,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:59,136 INFO L87 Difference]: Start difference. First operand 6134 states and 8548 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,171 INFO L93 Difference]: Finished difference Result 17674 states and 24502 transitions. [2025-02-05 16:39:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:39:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,189 INFO L225 Difference]: With dead ends: 17674 [2025-02-05 16:39:59,189 INFO L226 Difference]: Without dead ends: 11640 [2025-02-05 16:39:59,196 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:39:59,196 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 64 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 342 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:39:59,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11640 states. [2025-02-05 16:39:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11640 to 11110. [2025-02-05 16:39:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11110 states, 11109 states have (on average 1.3745611666216582) internal successors, (15270), 11109 states have internal predecessors, (15270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11110 states to 11110 states and 15270 transitions. [2025-02-05 16:39:59,366 INFO L78 Accepts]: Start accepts. Automaton has 11110 states and 15270 transitions. Word has length 98 [2025-02-05 16:39:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:59,366 INFO L471 AbstractCegarLoop]: Abstraction has 11110 states and 15270 transitions. [2025-02-05 16:39:59,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 11110 states and 15270 transitions. [2025-02-05 16:39:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:39:59,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,367 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:39:59,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:39:59,367 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:39:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash 900515987, now seen corresponding path program 1 times [2025-02-05 16:39:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026014533] [2025-02-05 16:39:59,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:39:59,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:39:59,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,427 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:39:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026014533] [2025-02-05 16:39:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026014533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636768617] [2025-02-05 16:39:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:59,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:59,428 INFO L87 Difference]: Start difference. First operand 11110 states and 15270 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:39:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,485 INFO L93 Difference]: Finished difference Result 32074 states and 43744 transitions. [2025-02-05 16:39:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:59,485 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:39:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,515 INFO L225 Difference]: With dead ends: 32074 [2025-02-05 16:39:59,515 INFO L226 Difference]: Without dead ends: 21064 [2025-02-05 16:39:59,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:59,527 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 54 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 340 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:39:59,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 340 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2025-02-05 16:39:59,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 20006. [2025-02-05 16:39:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20006 states, 20005 states have (on average 1.3495626093476631) internal successors, (26998), 20005 states have internal predecessors, (26998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 26998 transitions. [2025-02-05 16:39:59,712 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 26998 transitions. Word has length 99 [2025-02-05 16:39:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:59,712 INFO L471 AbstractCegarLoop]: Abstraction has 20006 states and 26998 transitions. [2025-02-05 16:39:59,712 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:39:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 26998 transitions. [2025-02-05 16:39:59,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:39:59,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:59,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:39:59,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:39:59,713 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:39:59,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:59,713 INFO L85 PathProgramCache]: Analyzing trace with hash -478706580, now seen corresponding path program 1 times [2025-02-05 16:39:59,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:59,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185433090] [2025-02-05 16:39:59,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:59,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:59,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:39:59,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:39:59,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:59,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185433090] [2025-02-05 16:39:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185433090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:59,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:59,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:39:59,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175416896] [2025-02-05 16:39:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:39:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:59,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:39:59,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:39:59,880 INFO L87 Difference]: Start difference. First operand 20006 states and 26998 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:59,931 INFO L93 Difference]: Finished difference Result 20488 states and 27639 transitions. [2025-02-05 16:39:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:39:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 16:39:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:59,955 INFO L225 Difference]: With dead ends: 20488 [2025-02-05 16:39:59,955 INFO L226 Difference]: Without dead ends: 20486 [2025-02-05 16:39:59,961 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:39:59,962 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:59,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2025-02-05 16:40:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20486. [2025-02-05 16:40:00,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 20485 states have (on average 1.3319990236758603) internal successors, (27286), 20485 states have internal predecessors, (27286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 27286 transitions. [2025-02-05 16:40:00,140 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 27286 transitions. Word has length 100 [2025-02-05 16:40:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 20486 states and 27286 transitions. [2025-02-05 16:40:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 27286 transitions. [2025-02-05 16:40:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:40:00,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:00,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:40:00,141 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:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1477032781, now seen corresponding path program 1 times [2025-02-05 16:40:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005901006] [2025-02-05 16:40:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:00,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:40:00,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:40:00,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:00,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:00,175 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:00,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:00,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005901006] [2025-02-05 16:40:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005901006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:00,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:00,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:40:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67219443] [2025-02-05 16:40:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:00,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:40:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:00,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:40:00,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:40:00,176 INFO L87 Difference]: Start difference. First operand 20486 states and 27286 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:00,248 INFO L93 Difference]: Finished difference Result 41514 states and 55328 transitions. [2025-02-05 16:40:00,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:40:00,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 16:40:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:00,277 INFO L225 Difference]: With dead ends: 41514 [2025-02-05 16:40:00,277 INFO L226 Difference]: Without dead ends: 21128 [2025-02-05 16:40:00,293 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:00,294 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 87 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:00,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 282 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:40:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21128 states. [2025-02-05 16:40:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21128 to 21126. [2025-02-05 16:40:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21126 states, 21125 states have (on average 1.3151242603550295) internal successors, (27782), 21125 states have internal predecessors, (27782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21126 states to 21126 states and 27782 transitions. [2025-02-05 16:40:00,568 INFO L78 Accepts]: Start accepts. Automaton has 21126 states and 27782 transitions. Word has length 100 [2025-02-05 16:40:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:00,568 INFO L471 AbstractCegarLoop]: Abstraction has 21126 states and 27782 transitions. [2025-02-05 16:40:00,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 21126 states and 27782 transitions. [2025-02-05 16:40:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:40:00,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:00,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:00,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:40:00,573 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:00,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 895650102, now seen corresponding path program 1 times [2025-02-05 16:40:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547877801] [2025-02-05 16:40:00,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:00,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:00,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:00,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:00,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547877801] [2025-02-05 16:40:00,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547877801] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141045300] [2025-02-05 16:40:00,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:01,001 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:01,002 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:01,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:40:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:40:01,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:01,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:01,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:01,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:02,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:03,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141045300] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:03,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:03,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-02-05 16:40:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676660562] [2025-02-05 16:40:03,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 16:40:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:03,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 16:40:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2025-02-05 16:40:03,398 INFO L87 Difference]: Start difference. First operand 21126 states and 27782 transitions. Second operand has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:11,997 INFO L93 Difference]: Finished difference Result 182908 states and 239657 transitions. [2025-02-05 16:40:11,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-02-05 16:40:11,998 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2025-02-05 16:40:11,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:12,355 INFO L225 Difference]: With dead ends: 182908 [2025-02-05 16:40:12,355 INFO L226 Difference]: Without dead ends: 161882 [2025-02-05 16:40:12,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10576 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4750, Invalid=27470, Unknown=0, NotChecked=0, Total=32220 [2025-02-05 16:40:12,398 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 3770 mSDsluCounter, 3105 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3770 SdHoareTripleChecker+Valid, 3327 SdHoareTripleChecker+Invalid, 4414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:12,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3770 Valid, 3327 Invalid, 4414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 16:40:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161882 states. [2025-02-05 16:40:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161882 to 106612. [2025-02-05 16:40:13,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106612 states, 106611 states have (on average 1.3051748881447505) internal successors, (139146), 106611 states have internal predecessors, (139146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:14,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106612 states to 106612 states and 139146 transitions. [2025-02-05 16:40:14,381 INFO L78 Accepts]: Start accepts. Automaton has 106612 states and 139146 transitions. Word has length 127 [2025-02-05 16:40:14,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:14,382 INFO L471 AbstractCegarLoop]: Abstraction has 106612 states and 139146 transitions. [2025-02-05 16:40:14,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.064516129032258) internal successors, (343), 30 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:14,382 INFO L276 IsEmpty]: Start isEmpty. Operand 106612 states and 139146 transitions. [2025-02-05 16:40:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-05 16:40:14,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:14,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:14,444 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:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:14,621 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:14,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:14,622 INFO L85 PathProgramCache]: Analyzing trace with hash 322156083, now seen corresponding path program 1 times [2025-02-05 16:40:14,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:14,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151584274] [2025-02-05 16:40:14,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:40:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:40:14,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:14,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:15,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:15,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151584274] [2025-02-05 16:40:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151584274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588635100] [2025-02-05 16:40:15,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:15,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:15,361 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:15,367 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:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-05 16:40:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-05 16:40:15,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:15,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:15,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:40:15,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:16,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:16,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588635100] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:16,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:16,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 27 [2025-02-05 16:40:16,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828543688] [2025-02-05 16:40:16,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:16,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:40:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:16,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:40:16,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:40:16,748 INFO L87 Difference]: Start difference. First operand 106612 states and 139146 transitions. Second operand has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:21,135 INFO L93 Difference]: Finished difference Result 390755 states and 509768 transitions. [2025-02-05 16:40:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-02-05 16:40:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-02-05 16:40:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:21,630 INFO L225 Difference]: With dead ends: 390755 [2025-02-05 16:40:21,631 INFO L226 Difference]: Without dead ends: 284295 [2025-02-05 16:40:21,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2066, Invalid=12214, Unknown=0, NotChecked=0, Total=14280 [2025-02-05 16:40:21,685 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 3228 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 3269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:21,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 3185 Invalid, 3269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 16:40:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284295 states. [2025-02-05 16:40:23,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284295 to 186306. [2025-02-05 16:40:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186306 states, 186305 states have (on average 1.2994498268967554) internal successors, (242094), 186305 states have internal predecessors, (242094), 0 states have call successors, (0), 0 states have call predecessors, (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,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186306 states to 186306 states and 242094 transitions. [2025-02-05 16:40:24,596 INFO L78 Accepts]: Start accepts. Automaton has 186306 states and 242094 transitions. Word has length 128 [2025-02-05 16:40:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:24,597 INFO L471 AbstractCegarLoop]: Abstraction has 186306 states and 242094 transitions. [2025-02-05 16:40:24,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 12.666666666666666) internal successors, (342), 27 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 186306 states and 242094 transitions. [2025-02-05 16:40:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:40:24,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:24,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:24,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:40:24,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:24,813 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:24,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1658197589, now seen corresponding path program 1 times [2025-02-05 16:40:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472977125] [2025-02-05 16:40:24,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:24,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:40:24,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:40:24,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:24,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:40:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472977125] [2025-02-05 16:40:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472977125] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:40:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:40:24,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:40:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680069609] [2025-02-05 16:40:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:40:24,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:40:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:24,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:40:24,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:40:24,868 INFO L87 Difference]: Start difference. First operand 186306 states and 242094 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (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,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:25,846 INFO L93 Difference]: Finished difference Result 363868 states and 472658 transitions. [2025-02-05 16:40:25,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:40:25,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-05 16:40:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:26,436 INFO L225 Difference]: With dead ends: 363868 [2025-02-05 16:40:26,437 INFO L226 Difference]: Without dead ends: 257408 [2025-02-05 16:40:26,472 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:26,472 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 102 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 279 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:26,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 279 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:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257408 states. [2025-02-05 16:40:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257408 to 185478. [2025-02-05 16:40:28,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185478 states, 185477 states have (on average 1.2963224550752923) internal successors, (240438), 185477 states have internal predecessors, (240438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185478 states to 185478 states and 240438 transitions. [2025-02-05 16:40:28,879 INFO L78 Accepts]: Start accepts. Automaton has 185478 states and 240438 transitions. Word has length 129 [2025-02-05 16:40:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:28,879 INFO L471 AbstractCegarLoop]: Abstraction has 185478 states and 240438 transitions. [2025-02-05 16:40:28,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 185478 states and 240438 transitions. [2025-02-05 16:40:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:40:28,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:28,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:28,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-05 16:40:28,896 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:28,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:28,897 INFO L85 PathProgramCache]: Analyzing trace with hash 88785878, now seen corresponding path program 1 times [2025-02-05 16:40:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479606755] [2025-02-05 16:40:28,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:40:28,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:40:28,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479606755] [2025-02-05 16:40:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479606755] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941883617] [2025-02-05 16:40:29,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:29,689 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:29,693 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:29,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:40:29,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:40:29,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:29,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:29,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 16:40:29,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:30,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941883617] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:31,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 29 [2025-02-05 16:40:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005753110] [2025-02-05 16:40:31,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:40:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:31,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:40:31,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:40:31,176 INFO L87 Difference]: Start difference. First operand 185478 states and 240438 transitions. Second operand has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (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,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:37,981 INFO L93 Difference]: Finished difference Result 654429 states and 850301 transitions. [2025-02-05 16:40:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-02-05 16:40:37,981 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-05 16:40:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:38,623 INFO L225 Difference]: With dead ends: 654429 [2025-02-05 16:40:38,623 INFO L226 Difference]: Without dead ends: 548401 [2025-02-05 16:40:38,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7330 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2500, Invalid=19850, Unknown=0, NotChecked=0, Total=22350 [2025-02-05 16:40:38,694 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1634 mSDsluCounter, 3981 mSDsCounter, 0 mSdLazyCounter, 4356 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 4186 SdHoareTripleChecker+Invalid, 4384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:38,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 4186 Invalid, 4384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4356 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 16:40:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548401 states. [2025-02-05 16:40:42,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548401 to 241324. [2025-02-05 16:40:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241324 states, 241323 states have (on average 1.295400769922469) internal successors, (312610), 241323 states have internal predecessors, (312610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241324 states to 241324 states and 312610 transitions. [2025-02-05 16:40:43,014 INFO L78 Accepts]: Start accepts. Automaton has 241324 states and 312610 transitions. Word has length 129 [2025-02-05 16:40:43,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:40:43,014 INFO L471 AbstractCegarLoop]: Abstraction has 241324 states and 312610 transitions. [2025-02-05 16:40:43,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 29 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:43,014 INFO L276 IsEmpty]: Start isEmpty. Operand 241324 states and 312610 transitions. [2025-02-05 16:40:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 16:40:43,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:40:43,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:40:43,046 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:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:43,226 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-05 16:40:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:40:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 508416692, now seen corresponding path program 1 times [2025-02-05 16:40:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:40:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683474732] [2025-02-05 16:40:43,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:43,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:40:43,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:40:43,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:40:43,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:43,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:40:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683474732] [2025-02-05 16:40:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683474732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:40:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28512757] [2025-02-05 16:40:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:40:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:40:43,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:40:43,806 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:43,807 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:43,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 16:40:44,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 16:40:44,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:40:44,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:40:44,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:40:44,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:40:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:44,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:40:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:40:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28512757] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:40:45,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:40:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 32 [2025-02-05 16:40:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365027292] [2025-02-05 16:40:45,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:40:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 16:40:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:40:45,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 16:40:45,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-02-05 16:40:45,641 INFO L87 Difference]: Start difference. First operand 241324 states and 312610 transitions. Second operand has 32 states, 32 states have (on average 10.8125) internal successors, (346), 32 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:40:54,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:40:54,404 INFO L93 Difference]: Finished difference Result 681556 states and 886182 transitions. [2025-02-05 16:40:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-02-05 16:40:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 10.8125) internal successors, (346), 32 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-02-05 16:40:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:40:55,160 INFO L225 Difference]: With dead ends: 681556 [2025-02-05 16:40:55,160 INFO L226 Difference]: Without dead ends: 488820 [2025-02-05 16:40:55,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8885 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3761, Invalid=21045, Unknown=0, NotChecked=0, Total=24806 [2025-02-05 16:40:55,381 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 7723 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7723 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:40:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7723 Valid, 2626 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 16:40:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488820 states.