./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cbde3ab1953d8937efac8b8b2822040abdf74b6ffa6ca789e8e69e82dc2a63c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:03:10,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:03:10,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:03:10,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:03:10,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:03:10,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:03:10,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:03:10,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:03:10,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:03:10,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:03:10,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:03:10,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:03:10,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:03:10,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:03:10,119 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:03:10,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:03:10,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:03:10,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:03:10,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:03:10,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:03:10,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:03:10,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:03:10,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:03:10,122 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cbde3ab1953d8937efac8b8b2822040abdf74b6ffa6ca789e8e69e82dc2a63c0 [2025-03-03 15:03:10,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:03:10,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:03:10,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:03:10,370 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:03:10,370 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:03:10,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:03:11,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df65209c/9311e6df24d74bd49a02ef27c4cd623d/FLAG9d75c97be [2025-03-03 15:03:11,826 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:03:11,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:03:11,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df65209c/9311e6df24d74bd49a02ef27c4cd623d/FLAG9d75c97be [2025-03-03 15:03:12,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3df65209c/9311e6df24d74bd49a02ef27c4cd623d [2025-03-03 15:03:12,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:03:12,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:03:12,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:03:12,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:03:12,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:03:12,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:03:12" (1/1) ... [2025-03-03 15:03:12,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1d622a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:12, skipping insertion in model container [2025-03-03 15:03:12,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:03:12" (1/1) ... [2025-03-03 15:03:12,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:03:12,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31102,31115] [2025-03-03 15:03:12,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31992,32005] [2025-03-03 15:03:12,594 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[33651,33664] [2025-03-03 15:03:12,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34541,34554] [2025-03-03 15:03:12,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[36972,36985] [2025-03-03 15:03:12,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37865,37878] [2025-03-03 15:03:12,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[39527,39540] [2025-03-03 15:03:12,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[40888,40901] [2025-03-03 15:03:12,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[54752,54765] [2025-03-03 15:03:12,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[55645,55658] [2025-03-03 15:03:12,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[57307,57320] [2025-03-03 15:03:12,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61464,61477] [2025-03-03 15:03:12,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:03:12,862 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:03:13,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31102,31115] [2025-03-03 15:03:13,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[31992,32005] [2025-03-03 15:03:13,028 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[33651,33664] [2025-03-03 15:03:13,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34541,34554] [2025-03-03 15:03:13,049 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[36972,36985] [2025-03-03 15:03:13,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37865,37878] [2025-03-03 15:03:13,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[39527,39540] [2025-03-03 15:03:13,079 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[40888,40901] [2025-03-03 15:03:13,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[54752,54765] [2025-03-03 15:03:13,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[55645,55658] [2025-03-03 15:03:13,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[57307,57320] [2025-03-03 15:03:13,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61464,61477] [2025-03-03 15:03:13,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:03:13,243 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:03:13,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13 WrapperNode [2025-03-03 15:03:13,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:03:13,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:03:13,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:03:13,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:03:13,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,351 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3915 [2025-03-03 15:03:13,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:03:13,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:03:13,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:03:13,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:03:13,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,407 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:03:13,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:03:13,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:03:13,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:03:13,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:03:13,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (1/1) ... [2025-03-03 15:03:13,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:03:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:03:13,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:03:13,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:03:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:03:13,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:03:13,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:03:13,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:03:13,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:03:13,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:03:15,676 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc main_~check__tmp~17#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3038: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4628: havoc main_~check__tmp~21#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1855: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3177: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1988: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2254: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4501: havoc main_~check__tmp~20#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3316: havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4252: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-03-03 15:03:15,677 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3726: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1622: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;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;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#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;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;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2045: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2311: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2444: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2709: havoc main_~check__tmp~13#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4298: havoc main_~check__tmp~19#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3783: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-03-03 15:03:15,678 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3916: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-03-03 15:03:15,934 INFO L? ?]: Removed 254 outVars from TransFormulas that were not future-live. [2025-03-03 15:03:15,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:03:15,952 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:03:15,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:03:15,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:03:15 BoogieIcfgContainer [2025-03-03 15:03:15,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:03:15,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:03:15,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:03:15,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:03:15,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:03:12" (1/3) ... [2025-03-03 15:03:15,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a18b6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:03:15, skipping insertion in model container [2025-03-03 15:03:15,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:03:13" (2/3) ... [2025-03-03 15:03:15,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a18b6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:03:15, skipping insertion in model container [2025-03-03 15:03:15,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:03:15" (3/3) ... [2025-03-03 15:03:15,959 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:03:15,971 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:03:15,974 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 889 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-03 15:03:16,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:03:16,039 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;@499ddbd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:03:16,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-03 15:03:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 889 states, 876 states have (on average 1.8356164383561644) internal successors, (1608), 888 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 15:03:16,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:16,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:16,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 469766592, now seen corresponding path program 1 times [2025-03-03 15:03:16,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518064937] [2025-03-03 15:03:16,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 15:03:16,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 15:03:16,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:16,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518064937] [2025-03-03 15:03:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518064937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383914479] [2025-03-03 15:03:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:16,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:16,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:16,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:16,848 INFO L87 Difference]: Start difference. First operand has 889 states, 876 states have (on average 1.8356164383561644) internal successors, (1608), 888 states have internal predecessors, (1608), 0 states have call successors, (0), 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 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:17,068 INFO L93 Difference]: Finished difference Result 1527 states and 2742 transitions. [2025-03-03 15:03:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2025-03-03 15:03:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:17,085 INFO L225 Difference]: With dead ends: 1527 [2025-03-03 15:03:17,085 INFO L226 Difference]: Without dead ends: 1264 [2025-03-03 15:03:17,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:17,096 INFO L435 NwaCegarLoop]: 1762 mSDtfsCounter, 829 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2934 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:17,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2934 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-03-03 15:03:17,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1262. [2025-03-03 15:03:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1250 states have (on average 1.5456) internal successors, (1932), 1261 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1932 transitions. [2025-03-03 15:03:17,177 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1932 transitions. Word has length 294 [2025-03-03 15:03:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:17,178 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1932 transitions. [2025-03-03 15:03:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1932 transitions. [2025-03-03 15:03:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 15:03:17,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:17,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:17,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:03:17,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:17,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash 896181952, now seen corresponding path program 1 times [2025-03-03 15:03:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753697853] [2025-03-03 15:03:17,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:17,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 15:03:17,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 15:03:17,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:17,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753697853] [2025-03-03 15:03:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753697853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850226993] [2025-03-03 15:03:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:17,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:17,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:17,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:17,461 INFO L87 Difference]: Start difference. First operand 1262 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:17,603 INFO L93 Difference]: Finished difference Result 2389 states and 3698 transitions. [2025-03-03 15:03:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2025-03-03 15:03:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:17,616 INFO L225 Difference]: With dead ends: 2389 [2025-03-03 15:03:17,616 INFO L226 Difference]: Without dead ends: 2018 [2025-03-03 15:03:17,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:17,620 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 672 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2493 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-03-03 15:03:17,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 2493 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2025-03-03 15:03:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2016. [2025-03-03 15:03:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2004 states have (on average 1.5439121756487026) internal successors, (3094), 2015 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3094 transitions. [2025-03-03 15:03:17,689 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3094 transitions. Word has length 294 [2025-03-03 15:03:17,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:17,690 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3094 transitions. [2025-03-03 15:03:17,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:17,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3094 transitions. [2025-03-03 15:03:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 15:03:17,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:17,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:17,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:03:17,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:17,700 INFO L85 PathProgramCache]: Analyzing trace with hash 371954592, now seen corresponding path program 1 times [2025-03-03 15:03:17,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:17,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982413778] [2025-03-03 15:03:17,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 15:03:17,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 15:03:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982413778] [2025-03-03 15:03:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982413778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315741006] [2025-03-03 15:03:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:17,959 INFO L87 Difference]: Start difference. First operand 2016 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:18,212 INFO L93 Difference]: Finished difference Result 4139 states and 6435 transitions. [2025-03-03 15:03:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:18,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2025-03-03 15:03:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:18,223 INFO L225 Difference]: With dead ends: 4139 [2025-03-03 15:03:18,223 INFO L226 Difference]: Without dead ends: 3570 [2025-03-03 15:03:18,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:18,225 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 732 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:18,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 2473 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:03:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2025-03-03 15:03:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3568. [2025-03-03 15:03:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3568 states, 3556 states have (on average 1.5438695163104612) internal successors, (5490), 3567 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 5490 transitions. [2025-03-03 15:03:18,281 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 5490 transitions. Word has length 294 [2025-03-03 15:03:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 3568 states and 5490 transitions. [2025-03-03 15:03:18,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 5490 transitions. [2025-03-03 15:03:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 15:03:18,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:18,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:18,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:03:18,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 371554400, now seen corresponding path program 1 times [2025-03-03 15:03:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432127652] [2025-03-03 15:03:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:18,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:18,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-03 15:03:18,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-03 15:03:18,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:19,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432127652] [2025-03-03 15:03:19,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432127652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:19,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:19,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:19,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055475324] [2025-03-03 15:03:19,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:19,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:19,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:19,111 INFO L87 Difference]: Start difference. First operand 3568 states and 5490 transitions. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:19,332 INFO L93 Difference]: Finished difference Result 17586 states and 27023 transitions. [2025-03-03 15:03:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:03:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2025-03-03 15:03:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:19,375 INFO L225 Difference]: With dead ends: 17586 [2025-03-03 15:03:19,375 INFO L226 Difference]: Without dead ends: 14029 [2025-03-03 15:03:19,386 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-03-03 15:03:19,386 INFO L435 NwaCegarLoop]: 2318 mSDtfsCounter, 4064 mSDsluCounter, 3584 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4064 SdHoareTripleChecker+Valid, 5902 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:19,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4064 Valid, 5902 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14029 states. [2025-03-03 15:03:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14029 to 6883. [2025-03-03 15:03:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6883 states, 6871 states have (on average 1.5358754184252656) internal successors, (10553), 6882 states have internal predecessors, (10553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6883 states to 6883 states and 10553 transitions. [2025-03-03 15:03:19,563 INFO L78 Accepts]: Start accepts. Automaton has 6883 states and 10553 transitions. Word has length 294 [2025-03-03 15:03:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:19,563 INFO L471 AbstractCegarLoop]: Abstraction has 6883 states and 10553 transitions. [2025-03-03 15:03:19,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6883 states and 10553 transitions. [2025-03-03 15:03:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 15:03:19,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:19,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:19,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:03:19,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:19,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 225218716, now seen corresponding path program 1 times [2025-03-03 15:03:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:19,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228427174] [2025-03-03 15:03:19,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:19,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:19,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 15:03:19,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 15:03:19,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:19,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228427174] [2025-03-03 15:03:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228427174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:19,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398020919] [2025-03-03 15:03:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:19,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:19,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:19,799 INFO L87 Difference]: Start difference. First operand 6883 states and 10553 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:19,940 INFO L93 Difference]: Finished difference Result 20256 states and 31003 transitions. [2025-03-03 15:03:19,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:19,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2025-03-03 15:03:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:19,970 INFO L225 Difference]: With dead ends: 20256 [2025-03-03 15:03:19,971 INFO L226 Difference]: Without dead ends: 13498 [2025-03-03 15:03:19,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:19,984 INFO L435 NwaCegarLoop]: 2572 mSDtfsCounter, 1211 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:19,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 3862 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:19,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2025-03-03 15:03:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 13352. [2025-03-03 15:03:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13352 states, 13340 states have (on average 1.526536731634183) internal successors, (20364), 13351 states have internal predecessors, (20364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13352 states to 13352 states and 20364 transitions. [2025-03-03 15:03:20,279 INFO L78 Accepts]: Start accepts. Automaton has 13352 states and 20364 transitions. Word has length 296 [2025-03-03 15:03:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:20,279 INFO L471 AbstractCegarLoop]: Abstraction has 13352 states and 20364 transitions. [2025-03-03 15:03:20,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:20,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13352 states and 20364 transitions. [2025-03-03 15:03:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 15:03:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:20,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:03:20,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2145539671, now seen corresponding path program 1 times [2025-03-03 15:03:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687190684] [2025-03-03 15:03:20,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:20,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 15:03:20,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 15:03:20,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:20,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:20,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:20,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687190684] [2025-03-03 15:03:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687190684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:20,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:20,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:20,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831746660] [2025-03-03 15:03:20,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:20,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:20,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:20,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:20,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:20,468 INFO L87 Difference]: Start difference. First operand 13352 states and 20364 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:20,616 INFO L93 Difference]: Finished difference Result 39989 states and 60976 transitions. [2025-03-03 15:03:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:20,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 296 [2025-03-03 15:03:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:20,746 INFO L225 Difference]: With dead ends: 39989 [2025-03-03 15:03:20,746 INFO L226 Difference]: Without dead ends: 26675 [2025-03-03 15:03:20,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:20,758 INFO L435 NwaCegarLoop]: 2678 mSDtfsCounter, 1336 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 4015 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:20,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 4015 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26675 states. [2025-03-03 15:03:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26675 to 13371. [2025-03-03 15:03:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13371 states, 13359 states have (on average 1.5264615614941237) internal successors, (20392), 13370 states have internal predecessors, (20392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13371 states to 13371 states and 20392 transitions. [2025-03-03 15:03:21,074 INFO L78 Accepts]: Start accepts. Automaton has 13371 states and 20392 transitions. Word has length 296 [2025-03-03 15:03:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:21,074 INFO L471 AbstractCegarLoop]: Abstraction has 13371 states and 20392 transitions. [2025-03-03 15:03:21,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13371 states and 20392 transitions. [2025-03-03 15:03:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-03 15:03:21,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:21,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:21,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:03:21,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:21,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1974455286, now seen corresponding path program 1 times [2025-03-03 15:03:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:21,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966940186] [2025-03-03 15:03:21,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:21,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:21,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-03 15:03:21,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-03 15:03:21,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:21,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966940186] [2025-03-03 15:03:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966940186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:21,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606406049] [2025-03-03 15:03:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:21,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:21,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:21,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:21,242 INFO L87 Difference]: Start difference. First operand 13371 states and 20392 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:21,346 INFO L93 Difference]: Finished difference Result 26704 states and 40717 transitions. [2025-03-03 15:03:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 297 [2025-03-03 15:03:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:21,369 INFO L225 Difference]: With dead ends: 26704 [2025-03-03 15:03:21,369 INFO L226 Difference]: Without dead ends: 13389 [2025-03-03 15:03:21,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:21,386 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 5 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:21,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2705 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13389 states. [2025-03-03 15:03:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13389 to 13389. [2025-03-03 15:03:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13389 states, 13377 states have (on average 1.5259774239366075) internal successors, (20413), 13388 states have internal predecessors, (20413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13389 states to 13389 states and 20413 transitions. [2025-03-03 15:03:21,619 INFO L78 Accepts]: Start accepts. Automaton has 13389 states and 20413 transitions. Word has length 297 [2025-03-03 15:03:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 13389 states and 20413 transitions. [2025-03-03 15:03:21,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 13389 states and 20413 transitions. [2025-03-03 15:03:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 15:03:21,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:21,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:03:21,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1595126873, now seen corresponding path program 1 times [2025-03-03 15:03:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480470568] [2025-03-03 15:03:21,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:21,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 15:03:21,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 15:03:21,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:21,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-03-03 15:03:21,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480470568] [2025-03-03 15:03:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480470568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468280811] [2025-03-03 15:03:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:21,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:21,799 INFO L87 Difference]: Start difference. First operand 13389 states and 20413 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:21,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:21,938 INFO L93 Difference]: Finished difference Result 37865 states and 57606 transitions. [2025-03-03 15:03:21,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:21,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2025-03-03 15:03:21,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:21,980 INFO L225 Difference]: With dead ends: 37865 [2025-03-03 15:03:21,981 INFO L226 Difference]: Without dead ends: 24717 [2025-03-03 15:03:22,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:22,002 INFO L435 NwaCegarLoop]: 2632 mSDtfsCounter, 1205 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:22,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 3922 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:22,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24717 states. [2025-03-03 15:03:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24717 to 24571. [2025-03-03 15:03:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24571 states, 24559 states have (on average 1.5141903171953255) internal successors, (37187), 24570 states have internal predecessors, (37187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24571 states to 24571 states and 37187 transitions. [2025-03-03 15:03:22,426 INFO L78 Accepts]: Start accepts. Automaton has 24571 states and 37187 transitions. Word has length 298 [2025-03-03 15:03:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:22,426 INFO L471 AbstractCegarLoop]: Abstraction has 24571 states and 37187 transitions. [2025-03-03 15:03:22,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 24571 states and 37187 transitions. [2025-03-03 15:03:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 15:03:22,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:22,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:22,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:03:22,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:22,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash 654206231, now seen corresponding path program 1 times [2025-03-03 15:03:22,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:22,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858458059] [2025-03-03 15:03:22,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 15:03:22,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 15:03:22,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:22,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858458059] [2025-03-03 15:03:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858458059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330356236] [2025-03-03 15:03:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:23,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:23,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:23,144 INFO L87 Difference]: Start difference. First operand 24571 states and 37187 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:23,496 INFO L93 Difference]: Finished difference Result 96238 states and 145368 transitions. [2025-03-03 15:03:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 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 298 [2025-03-03 15:03:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:23,632 INFO L225 Difference]: With dead ends: 96238 [2025-03-03 15:03:23,632 INFO L226 Difference]: Without dead ends: 71843 [2025-03-03 15:03:23,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:23,690 INFO L435 NwaCegarLoop]: 3138 mSDtfsCounter, 2816 mSDsluCounter, 2538 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2816 SdHoareTripleChecker+Valid, 5676 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:23,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2816 Valid, 5676 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71843 states. [2025-03-03 15:03:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71843 to 48092. [2025-03-03 15:03:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48092 states, 48080 states have (on average 1.5041805324459234) internal successors, (72321), 48091 states have internal predecessors, (72321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48092 states to 48092 states and 72321 transitions. [2025-03-03 15:03:24,824 INFO L78 Accepts]: Start accepts. Automaton has 48092 states and 72321 transitions. Word has length 298 [2025-03-03 15:03:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 48092 states and 72321 transitions. [2025-03-03 15:03:24,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 4 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48092 states and 72321 transitions. [2025-03-03 15:03:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 15:03:24,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:24,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:03:24,867 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash 723878149, now seen corresponding path program 1 times [2025-03-03 15:03:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:24,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803157049] [2025-03-03 15:03:24,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:24,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:24,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 15:03:24,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 15:03:24,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:24,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803157049] [2025-03-03 15:03:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803157049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616369418] [2025-03-03 15:03:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:25,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:25,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:25,507 INFO L87 Difference]: Start difference. First operand 48092 states and 72321 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:25,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:25,680 INFO L93 Difference]: Finished difference Result 96138 states and 144588 transitions. [2025-03-03 15:03:25,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:25,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-03-03 15:03:25,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:25,760 INFO L225 Difference]: With dead ends: 96138 [2025-03-03 15:03:25,760 INFO L226 Difference]: Without dead ends: 48896 [2025-03-03 15:03:25,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:25,806 INFO L435 NwaCegarLoop]: 1465 mSDtfsCounter, 93 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:25,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 4267 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48896 states. [2025-03-03 15:03:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48896 to 48896. [2025-03-03 15:03:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48896 states, 48884 states have (on average 1.5074461991653711) internal successors, (73690), 48895 states have internal predecessors, (73690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48896 states to 48896 states and 73690 transitions. [2025-03-03 15:03:26,486 INFO L78 Accepts]: Start accepts. Automaton has 48896 states and 73690 transitions. Word has length 300 [2025-03-03 15:03:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:26,486 INFO L471 AbstractCegarLoop]: Abstraction has 48896 states and 73690 transitions. [2025-03-03 15:03:26,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 48896 states and 73690 transitions. [2025-03-03 15:03:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 15:03:26,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:26,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:26,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:03:26,523 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:26,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:26,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2065142284, now seen corresponding path program 1 times [2025-03-03 15:03:26,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:26,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110209194] [2025-03-03 15:03:26,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:26,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:26,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 15:03:26,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 15:03:26,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:26,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110209194] [2025-03-03 15:03:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110209194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:26,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:26,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:26,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905728523] [2025-03-03 15:03:26,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:26,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:26,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:26,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:26,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:26,655 INFO L87 Difference]: Start difference. First operand 48896 states and 73690 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:26,939 INFO L93 Difference]: Finished difference Result 144283 states and 217179 transitions. [2025-03-03 15:03:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-03-03 15:03:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:27,052 INFO L225 Difference]: With dead ends: 144283 [2025-03-03 15:03:27,053 INFO L226 Difference]: Without dead ends: 95785 [2025-03-03 15:03:27,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:27,112 INFO L435 NwaCegarLoop]: 2612 mSDtfsCounter, 1187 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 3894 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:27,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 3894 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:03:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95785 states. [2025-03-03 15:03:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95785 to 95657. [2025-03-03 15:03:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95657 states, 95645 states have (on average 1.4969418160907522) internal successors, (143175), 95656 states have internal predecessors, (143175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95657 states to 95657 states and 143175 transitions. [2025-03-03 15:03:28,687 INFO L78 Accepts]: Start accepts. Automaton has 95657 states and 143175 transitions. Word has length 300 [2025-03-03 15:03:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:28,687 INFO L471 AbstractCegarLoop]: Abstraction has 95657 states and 143175 transitions. [2025-03-03 15:03:28,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 95657 states and 143175 transitions. [2025-03-03 15:03:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-03 15:03:28,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:28,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:28,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:03:28,765 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:28,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1285830194, now seen corresponding path program 1 times [2025-03-03 15:03:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887717267] [2025-03-03 15:03:28,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-03 15:03:29,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-03 15:03:29,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:29,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:29,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887717267] [2025-03-03 15:03:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887717267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:29,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:29,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475518668] [2025-03-03 15:03:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:29,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:29,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:29,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:29,581 INFO L87 Difference]: Start difference. First operand 95657 states and 143175 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:30,072 INFO L93 Difference]: Finished difference Result 283210 states and 423010 transitions. [2025-03-03 15:03:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:30,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-03-03 15:03:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:30,320 INFO L225 Difference]: With dead ends: 283210 [2025-03-03 15:03:30,321 INFO L226 Difference]: Without dead ends: 190444 [2025-03-03 15:03:30,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:30,441 INFO L435 NwaCegarLoop]: 1832 mSDtfsCounter, 1295 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 5001 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:30,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 5001 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190444 states. [2025-03-03 15:03:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190444 to 98398. [2025-03-03 15:03:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98398 states, 98386 states have (on average 1.5017787083528145) internal successors, (147754), 98397 states have internal predecessors, (147754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98398 states to 98398 states and 147754 transitions. [2025-03-03 15:03:32,685 INFO L78 Accepts]: Start accepts. Automaton has 98398 states and 147754 transitions. Word has length 300 [2025-03-03 15:03:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:32,685 INFO L471 AbstractCegarLoop]: Abstraction has 98398 states and 147754 transitions. [2025-03-03 15:03:32,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 98398 states and 147754 transitions. [2025-03-03 15:03:32,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 15:03:32,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:32,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:32,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:03:32,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:32,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:32,744 INFO L85 PathProgramCache]: Analyzing trace with hash -904345042, now seen corresponding path program 1 times [2025-03-03 15:03:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115156273] [2025-03-03 15:03:32,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:32,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 15:03:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 15:03:32,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:32,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:32,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115156273] [2025-03-03 15:03:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115156273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319127936] [2025-03-03 15:03:32,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:32,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:32,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:32,842 INFO L87 Difference]: Start difference. First operand 98398 states and 147754 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:34,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:34,003 INFO L93 Difference]: Finished difference Result 282082 states and 420990 transitions. [2025-03-03 15:03:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:34,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2025-03-03 15:03:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:34,206 INFO L225 Difference]: With dead ends: 282082 [2025-03-03 15:03:34,206 INFO L226 Difference]: Without dead ends: 189104 [2025-03-03 15:03:34,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:34,252 INFO L435 NwaCegarLoop]: 2604 mSDtfsCounter, 1221 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:34,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 3886 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:03:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189104 states. [2025-03-03 15:03:36,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189104 to 188970. [2025-03-03 15:03:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188970 states, 188958 states have (on average 1.4853988717069402) internal successors, (280678), 188969 states have internal predecessors, (280678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188970 states to 188970 states and 280678 transitions. [2025-03-03 15:03:37,183 INFO L78 Accepts]: Start accepts. Automaton has 188970 states and 280678 transitions. Word has length 302 [2025-03-03 15:03:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:37,183 INFO L471 AbstractCegarLoop]: Abstraction has 188970 states and 280678 transitions. [2025-03-03 15:03:37,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 188970 states and 280678 transitions. [2025-03-03 15:03:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 15:03:37,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:37,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:37,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:03:37,331 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:37,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash -267336791, now seen corresponding path program 1 times [2025-03-03 15:03:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911811810] [2025-03-03 15:03:37,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:37,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 15:03:37,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 15:03:37,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:37,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:37,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:37,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911811810] [2025-03-03 15:03:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911811810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:37,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253745202] [2025-03-03 15:03:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:37,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:37,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:37,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:37,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:37,487 INFO L87 Difference]: Start difference. First operand 188970 states and 280678 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:39,091 INFO L93 Difference]: Finished difference Result 551966 states and 816810 transitions. [2025-03-03 15:03:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2025-03-03 15:03:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:39,537 INFO L225 Difference]: With dead ends: 551966 [2025-03-03 15:03:39,537 INFO L226 Difference]: Without dead ends: 370584 [2025-03-03 15:03:39,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:39,639 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 1197 mSDsluCounter, 1342 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:39,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2692 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370584 states. [2025-03-03 15:03:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370584 to 190414. [2025-03-03 15:03:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190414 states, 190402 states have (on average 1.4832932427180388) internal successors, (282422), 190413 states have internal predecessors, (282422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190414 states to 190414 states and 282422 transitions. [2025-03-03 15:03:43,969 INFO L78 Accepts]: Start accepts. Automaton has 190414 states and 282422 transitions. Word has length 302 [2025-03-03 15:03:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:43,969 INFO L471 AbstractCegarLoop]: Abstraction has 190414 states and 282422 transitions. [2025-03-03 15:03:43,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 190414 states and 282422 transitions. [2025-03-03 15:03:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 15:03:44,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:44,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:44,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:03:44,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:44,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:44,097 INFO L85 PathProgramCache]: Analyzing trace with hash -921891102, now seen corresponding path program 1 times [2025-03-03 15:03:44,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:44,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558724117] [2025-03-03 15:03:44,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:44,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:44,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 15:03:44,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 15:03:44,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:44,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:44,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:44,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558724117] [2025-03-03 15:03:44,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558724117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:03:44,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491303250] [2025-03-03 15:03:44,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:03:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:44,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:03:44,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:44,209 INFO L87 Difference]: Start difference. First operand 190414 states and 282422 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:45,234 INFO L93 Difference]: Finished difference Result 373152 states and 552414 transitions. [2025-03-03 15:03:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:03:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 303 [2025-03-03 15:03:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:45,435 INFO L225 Difference]: With dead ends: 373152 [2025-03-03 15:03:45,436 INFO L226 Difference]: Without dead ends: 192010 [2025-03-03 15:03:45,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:03:45,545 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 7 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:45,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2704 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192010 states. [2025-03-03 15:03:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192010 to 190414. [2025-03-03 15:03:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190414 states, 190402 states have (on average 1.4832932427180388) internal successors, (282422), 190413 states have internal predecessors, (282422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190414 states to 190414 states and 282422 transitions. [2025-03-03 15:03:48,571 INFO L78 Accepts]: Start accepts. Automaton has 190414 states and 282422 transitions. Word has length 303 [2025-03-03 15:03:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:48,572 INFO L471 AbstractCegarLoop]: Abstraction has 190414 states and 282422 transitions. [2025-03-03 15:03:48,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 190414 states and 282422 transitions. [2025-03-03 15:03:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 15:03:48,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:03:48,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:03:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:03:48,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-03-03 15:03:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:03:48,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1728592681, now seen corresponding path program 1 times [2025-03-03 15:03:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:03:48,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249035685] [2025-03-03 15:03:48,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:03:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:03:48,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 15:03:48,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 15:03:48,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:03:48,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:03:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:03:49,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:03:49,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249035685] [2025-03-03 15:03:49,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249035685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:03:49,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:03:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:03:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286518032] [2025-03-03 15:03:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:03:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:03:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:03:49,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:03:49,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:49,567 INFO L87 Difference]: Start difference. First operand 190414 states and 282422 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:03:51,077 INFO L93 Difference]: Finished difference Result 556807 states and 823896 transitions. [2025-03-03 15:03:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:03:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 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 304 [2025-03-03 15:03:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:03:51,579 INFO L225 Difference]: With dead ends: 556807 [2025-03-03 15:03:51,579 INFO L226 Difference]: Without dead ends: 374677 [2025-03-03 15:03:51,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:03:51,771 INFO L435 NwaCegarLoop]: 2677 mSDtfsCounter, 1302 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1302 SdHoareTripleChecker+Valid, 6691 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:03:51,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1302 Valid, 6691 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:03:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374677 states. [2025-03-03 15:03:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374677 to 194507. [2025-03-03 15:03:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194507 states, 194495 states have (on average 1.4834108845985758) internal successors, (288516), 194506 states have internal predecessors, (288516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194507 states to 194507 states and 288516 transitions. [2025-03-03 15:03:56,179 INFO L78 Accepts]: Start accepts. Automaton has 194507 states and 288516 transitions. Word has length 304 [2025-03-03 15:03:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:03:56,180 INFO L471 AbstractCegarLoop]: Abstraction has 194507 states and 288516 transitions. [2025-03-03 15:03:56,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:03:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 194507 states and 288516 transitions.