./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:30:21,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:30:21,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:30:21,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:30:21,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:30:21,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:30:21,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:30:21,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:30:21,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:30:21,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:30:21,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:30:21,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:30:21,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:30:21,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:30:21,350 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:30:21,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:30:21,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:30:21,350 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:30:21,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:30:21,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:30:21,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:30:21,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:30:21,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:30:21,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:30:21,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:30:21,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:30:21,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:30:21,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:30:21,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:30:21,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:30:21,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:30:21,354 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c [2025-02-05 16:30:21,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:30:21,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:30:21,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:30:21,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:30:21,671 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:30:21,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:30:23,037 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef4247039/6705fee249d145db8ab150e568696bce/FLAGce92554ab [2025-02-05 16:30:23,575 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:30:23,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:30:23,611 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef4247039/6705fee249d145db8ab150e568696bce/FLAGce92554ab [2025-02-05 16:30:23,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ef4247039/6705fee249d145db8ab150e568696bce [2025-02-05 16:30:23,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:30:23,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:30:23,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:30:23,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:30:23,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:30:23,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:30:23" (1/1) ... [2025-02-05 16:30:23,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aae2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:23, skipping insertion in model container [2025-02-05 16:30:23,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:30:23" (1/1) ... [2025-02-05 16:30:23,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:30:24,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-02-05 16:30:24,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:30:24,636 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:30:24,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-02-05 16:30:25,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:30:25,136 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:30:25,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25 WrapperNode [2025-02-05 16:30:25,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:30:25,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:30:25,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:30:25,139 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:30:25,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25" (1/1) ... [2025-02-05 16:30:25,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25" (1/1) ... [2025-02-05 16:30:25,331 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4993 [2025-02-05 16:30:25,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:30:25,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:30:25,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:30:25,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:30:25,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25" (1/1) ... [2025-02-05 16:30:25,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25" (1/1) ... [2025-02-05 16:30:25,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:25" (1/1) ... [2025-02-05 16:30:25,472 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor has thrown an exception: java.lang.StackOverflowError at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:406) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) [2025-02-05 16:30:25,524 INFO L158 Benchmark]: Toolchain (without parser) took 1889.71ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 138.4MB in the end (delta: 16.0MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2025-02-05 16:30:25,524 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 16:30:25,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1506.04ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 80.7MB in the end (delta: 73.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-02-05 16:30:25,525 INFO L158 Benchmark]: Boogie Procedure Inliner took 193.68ms. Allocated memory is still 201.3MB. Free memory was 80.4MB in the beginning and 57.2MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 16:30:25,525 INFO L158 Benchmark]: Boogie Preprocessor took 185.81ms. Allocated memory is still 201.3MB. Free memory was 57.2MB in the beginning and 138.4MB in the end (delta: -81.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2025-02-05 16:30:25,526 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1506.04ms. Allocated memory is still 201.3MB. Free memory was 154.4MB in the beginning and 80.7MB in the end (delta: 73.7MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 193.68ms. Allocated memory is still 201.3MB. Free memory was 80.4MB in the beginning and 57.2MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 185.81ms. Allocated memory is still 201.3MB. Free memory was 57.2MB in the beginning and 138.4MB in the end (delta: -81.2MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - ExceptionOrErrorResult: StackOverflowError: null de.uni_freiburg.informatik.ultimate.boogie.preprocessor: StackOverflowError: null: de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:406) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:30:27,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:30:27,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 16:30:27,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:30:27,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:30:27,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:30:27,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:30:27,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:30:27,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:30:27,778 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:30:27,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:30:27,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:30:27,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:30:27,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 16:30:27,780 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:30:27,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:30:27,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 16:30:27,781 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:30:27,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:30:27,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:30:27,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:30:27,782 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c [2025-02-05 16:30:28,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:30:28,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:30:28,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:30:28,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:30:28,090 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:30:28,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:30:29,505 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a1c3242/2113acc9753d45fdb1d5b8120a58ea41/FLAGec560e8a6 [2025-02-05 16:30:29,994 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:30:29,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:30:30,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a1c3242/2113acc9753d45fdb1d5b8120a58ea41/FLAGec560e8a6 [2025-02-05 16:30:30,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87a1c3242/2113acc9753d45fdb1d5b8120a58ea41 [2025-02-05 16:30:30,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:30:30,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:30:30,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:30:30,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:30:30,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:30:30,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:30:30" (1/1) ... [2025-02-05 16:30:30,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd6d579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:30, skipping insertion in model container [2025-02-05 16:30:30,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:30:30" (1/1) ... [2025-02-05 16:30:30,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:30:30,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-02-05 16:30:30,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:30:30,958 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:30:31,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-02-05 16:30:31,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:30:31,443 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:30:31,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31 WrapperNode [2025-02-05 16:30:31,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:30:31,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:30:31,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:30:31,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:30:31,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,582 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4963 [2025-02-05 16:30:31,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:30:31,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:30:31,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:30:31,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:30:31,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,660 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:30:31,661 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,661 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:30:31,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:30:31,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:30:31,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:30:31,786 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (1/1) ... [2025-02-05 16:30:31,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:30:31,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:31,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:30:31,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:30:31,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:30:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 16:30:31,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:30:31,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:30:32,119 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:30:32,121 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:30:35,577 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3698: havoc main_~node3____CPAchecker_TMP_3~3#1;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-02-05 16:30:35,578 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc main_~node5____CPAchecker_TMP_3~3#1;havoc main_~node5____CPAchecker_TMP_2~3#1;havoc main_~node5____CPAchecker_TMP_1~3#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-02-05 16:30:35,578 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3875: havoc main_~node2____CPAchecker_TMP_3~3#1;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-02-05 16:30:35,578 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;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_~node5____CPAchecker_TMP_3~2#1;havoc main_~node5____CPAchecker_TMP_2~2#1;havoc main_~node5____CPAchecker_TMP_1~2#1;havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node4____CPAchecker_TMP_3~2#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_3~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_3~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_~node1____CPAchecker_TMP_3~2#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____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_~node5____CPAchecker_TMP_3~1#1;havoc main_~node5____CPAchecker_TMP_2~1#1;havoc main_~node5____CPAchecker_TMP_1~1#1;havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node4____CPAchecker_TMP_3~1#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_3~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_3~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_3~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_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node4____CPAchecker_TMP_3~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_3~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_3~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_3~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__r151~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r251~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r351~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r451~0#1, main_~init__r511~0#1, main_~init__r521~0#1, main_~init__r531~0#1, main_~init__r541~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__r152~0#1, main_~init__tmp___2~0#1, main_~init__r212~0#1, main_~init__tmp___3~0#1, main_~init__r232~0#1, main_~init__tmp___4~0#1, main_~init__r242~0#1, main_~init__tmp___5~0#1, main_~init__r252~0#1, main_~init__tmp___6~0#1, main_~init__r312~0#1, main_~init__tmp___7~0#1, main_~init__r322~0#1, main_~init__tmp___8~0#1, main_~init__r342~0#1, main_~init__tmp___9~0#1, main_~init__r352~0#1, main_~init__tmp___10~0#1, main_~init__r412~0#1, main_~init__tmp___11~0#1, main_~init__r422~0#1, main_~init__tmp___12~0#1, main_~init__r432~0#1, main_~init__tmp___13~0#1, main_~init__r452~0#1, main_~init__tmp___14~0#1, main_~init__r512~0#1, main_~init__tmp___15~0#1, main_~init__r522~0#1, main_~init__tmp___16~0#1, main_~init__r532~0#1, main_~init__tmp___17~0#1, main_~init__r542~0#1, main_~init__tmp___18~0#1, main_~init__r123~0#1, main_~init__tmp___19~0#1, main_~init__r133~0#1, main_~init__tmp___20~0#1, main_~init__r143~0#1, main_~init__tmp___21~0#1, main_~init__r153~0#1, main_~init__tmp___22~0#1, main_~init__r213~0#1, main_~init__tmp___23~0#1, main_~init__r233~0#1, main_~init__tmp___24~0#1, main_~init__r243~0#1, main_~init__tmp___25~0#1, main_~init__r253~0#1, main_~init__tmp___26~0#1, main_~init__r313~0#1, main_~init__tmp___27~0#1, main_~init__r323~0#1, main_~init__tmp___28~0#1, main_~init__r343~0#1, main_~init__tmp___29~0#1, main_~init__r353~0#1, main_~init__tmp___30~0#1, main_~init__r413~0#1, main_~init__tmp___31~0#1, main_~init__r423~0#1, main_~init__tmp___32~0#1, main_~init__r433~0#1, main_~init__tmp___33~0#1, main_~init__r453~0#1, main_~init__tmp___34~0#1, main_~init__r513~0#1, main_~init__tmp___35~0#1, main_~init__r523~0#1, main_~init__tmp___36~0#1, main_~init__r533~0#1, main_~init__tmp___37~0#1, main_~init__r543~0#1, main_~init__tmp___38~0#1, main_~init__r124~0#1, main_~init__tmp___39~0#1, main_~init__r134~0#1, main_~init__tmp___40~0#1, main_~init__r144~0#1, main_~init__tmp___41~0#1, main_~init__r154~0#1, main_~init__tmp___42~0#1, main_~init__r214~0#1, main_~init__tmp___43~0#1, main_~init__r234~0#1, main_~init__tmp___44~0#1, main_~init__r244~0#1, main_~init__tmp___45~0#1, main_~init__r254~0#1, main_~init__tmp___46~0#1, main_~init__r314~0#1, main_~init__tmp___47~0#1, main_~init__r324~0#1, main_~init__tmp___48~0#1, main_~init__r344~0#1, main_~init__tmp___49~0#1, main_~init__r354~0#1, main_~init__tmp___50~0#1, main_~init__r414~0#1, main_~init__tmp___51~0#1, main_~init__r424~0#1, main_~init__tmp___52~0#1, main_~init__r434~0#1, main_~init__tmp___53~0#1, main_~init__r454~0#1, main_~init__tmp___54~0#1, main_~init__r514~0#1, main_~init__tmp___55~0#1, main_~init__r524~0#1, main_~init__tmp___56~0#1, main_~init__r534~0#1, main_~init__tmp___57~0#1, main_~init__r544~0#1, main_~init__tmp___58~0#1, main_~init__tmp___59~0#1; [2025-02-05 16:30:35,579 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3124: havoc main_~check__tmp~6#1; [2025-02-05 16:30:35,579 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3521: havoc main_~node4____CPAchecker_TMP_3~3#1;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-02-05 16:30:35,579 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4052: havoc main_~node1____CPAchecker_TMP_3~3#1;havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-05 16:30:36,355 INFO L? ?]: Removed 350 outVars from TransFormulas that were not future-live. [2025-02-05 16:30:36,355 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:30:36,401 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:30:36,403 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:30:36,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:30:36 BoogieIcfgContainer [2025-02-05 16:30:36,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:30:36,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:30:36,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:30:36,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:30:36,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:30:30" (1/3) ... [2025-02-05 16:30:36,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc5b416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:30:36, skipping insertion in model container [2025-02-05 16:30:36,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:30:31" (2/3) ... [2025-02-05 16:30:36,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc5b416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:30:36, skipping insertion in model container [2025-02-05 16:30:36,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:30:36" (3/3) ... [2025-02-05 16:30:36,418 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-02-05 16:30:36,434 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:30:36,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 1317 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:30:36,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:30:36,544 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;@2fd46f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:30:36,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:30:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 1317 states, 1315 states have (on average 1.8068441064638783) internal successors, (2376), 1316 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-02-05 16:30:36,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:36,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:36,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:36,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1892936379, now seen corresponding path program 1 times [2025-02-05 16:30:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:36,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [306394326] [2025-02-05 16:30:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:36,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:36,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:30:36,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-02-05 16:30:37,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-02-05 16:30:37,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:37,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:37,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:30:37,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:37,996 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:37,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306394326] [2025-02-05 16:30:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306394326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:37,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:30:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500736985] [2025-02-05 16:30:38,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:38,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:30:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:38,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:30:38,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:30:38,035 INFO L87 Difference]: Start difference. First operand has 1317 states, 1315 states have (on average 1.8068441064638783) internal successors, (2376), 1316 states have internal predecessors, (2376), 0 states have call successors, (0), 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 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:38,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:38,512 INFO L93 Difference]: Finished difference Result 6162 states and 11106 transitions. [2025-02-05 16:30:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:30:38,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 463 [2025-02-05 16:30:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:38,559 INFO L225 Difference]: With dead ends: 6162 [2025-02-05 16:30:38,560 INFO L226 Difference]: Without dead ends: 4908 [2025-02-05 16:30:38,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:30:38,575 INFO L435 NwaCegarLoop]: 3621 mSDtfsCounter, 7271 mSDsluCounter, 5590 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7271 SdHoareTripleChecker+Valid, 9211 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:38,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7271 Valid, 9211 Invalid, 183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:30:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4908 states. [2025-02-05 16:30:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4908 to 2556. [2025-02-05 16:30:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2555 states have (on average 1.641095890410959) internal successors, (4193), 2555 states have internal predecessors, (4193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 4193 transitions. [2025-02-05 16:30:38,791 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 4193 transitions. Word has length 463 [2025-02-05 16:30:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:38,795 INFO L471 AbstractCegarLoop]: Abstraction has 2556 states and 4193 transitions. [2025-02-05 16:30:38,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 4193 transitions. [2025-02-05 16:30:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-02-05 16:30:38,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:38,811 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:38,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:30:39,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:39,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -640653335, now seen corresponding path program 1 times [2025-02-05 16:30:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141336172] [2025-02-05 16:30:39,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:39,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:39,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:39,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:39,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:30:39,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-05 16:30:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-05 16:30:39,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:39,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:39,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:39,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:39,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:39,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141336172] [2025-02-05 16:30:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141336172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776570136] [2025-02-05 16:30:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:39,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:39,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:39,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:39,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:39,681 INFO L87 Difference]: Start difference. First operand 2556 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:39,849 INFO L93 Difference]: Finished difference Result 7361 states and 12022 transitions. [2025-02-05 16:30:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 465 [2025-02-05 16:30:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:39,875 INFO L225 Difference]: With dead ends: 7361 [2025-02-05 16:30:39,875 INFO L226 Difference]: Without dead ends: 4967 [2025-02-05 16:30:39,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:39,884 INFO L435 NwaCegarLoop]: 4130 mSDtfsCounter, 1836 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 6232 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:39,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 6232 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:30:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4967 states. [2025-02-05 16:30:40,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4967 to 4965. [2025-02-05 16:30:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4965 states, 4964 states have (on average 1.6307413376309428) internal successors, (8095), 4964 states have internal predecessors, (8095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4965 states to 4965 states and 8095 transitions. [2025-02-05 16:30:40,062 INFO L78 Accepts]: Start accepts. Automaton has 4965 states and 8095 transitions. Word has length 465 [2025-02-05 16:30:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:40,063 INFO L471 AbstractCegarLoop]: Abstraction has 4965 states and 8095 transitions. [2025-02-05 16:30:40,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4965 states and 8095 transitions. [2025-02-05 16:30:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-05 16:30:40,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:40,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:40,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:30:40,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:40,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:40,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash 379454165, now seen corresponding path program 1 times [2025-02-05 16:30:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960610926] [2025-02-05 16:30:40,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:40,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:40,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:40,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:30:40,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-05 16:30:40,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-05 16:30:40,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:40,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:40,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:40,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:40,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:40,681 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:40,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960610926] [2025-02-05 16:30:40,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960610926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:40,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:40,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440205065] [2025-02-05 16:30:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:40,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:40,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:40,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:40,684 INFO L87 Difference]: Start difference. First operand 4965 states and 8095 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:40,808 INFO L93 Difference]: Finished difference Result 14379 states and 23335 transitions. [2025-02-05 16:30:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:40,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 466 [2025-02-05 16:30:40,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:40,848 INFO L225 Difference]: With dead ends: 14379 [2025-02-05 16:30:40,849 INFO L226 Difference]: Without dead ends: 9671 [2025-02-05 16:30:40,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:40,861 INFO L435 NwaCegarLoop]: 4114 mSDtfsCounter, 1965 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 6263 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:40,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 6263 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9671 states. [2025-02-05 16:30:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9671 to 5017. [2025-02-05 16:30:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 5016 states have (on average 1.6297846889952152) internal successors, (8175), 5016 states have internal predecessors, (8175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 8175 transitions. [2025-02-05 16:30:41,081 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 8175 transitions. Word has length 466 [2025-02-05 16:30:41,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:41,082 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 8175 transitions. [2025-02-05 16:30:41,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 8175 transitions. [2025-02-05 16:30:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-05 16:30:41,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:41,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:30:41,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:41,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1208486541, now seen corresponding path program 1 times [2025-02-05 16:30:41,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083544405] [2025-02-05 16:30:41,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:41,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:41,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:30:41,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-05 16:30:41,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-05 16:30:41,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:41,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:41,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:41,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:41,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:41,924 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083544405] [2025-02-05 16:30:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083544405] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36368688] [2025-02-05 16:30:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:41,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:41,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:41,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:41,927 INFO L87 Difference]: Start difference. First operand 5017 states and 8175 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:42,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:42,119 INFO L93 Difference]: Finished difference Result 14616 states and 23750 transitions. [2025-02-05 16:30:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:42,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 467 [2025-02-05 16:30:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:42,160 INFO L225 Difference]: With dead ends: 14616 [2025-02-05 16:30:42,160 INFO L226 Difference]: Without dead ends: 9855 [2025-02-05 16:30:42,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:42,169 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 1889 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 6302 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:42,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 6302 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:30:42,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9855 states. [2025-02-05 16:30:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9855 to 9853. [2025-02-05 16:30:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9853 states, 9852 states have (on average 1.6215996751928543) internal successors, (15976), 9852 states have internal predecessors, (15976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9853 states to 9853 states and 15976 transitions. [2025-02-05 16:30:42,440 INFO L78 Accepts]: Start accepts. Automaton has 9853 states and 15976 transitions. Word has length 467 [2025-02-05 16:30:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:42,441 INFO L471 AbstractCegarLoop]: Abstraction has 9853 states and 15976 transitions. [2025-02-05 16:30:42,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9853 states and 15976 transitions. [2025-02-05 16:30:42,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-02-05 16:30:42,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:42,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:42,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:30:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:42,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:42,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:42,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2053489202, now seen corresponding path program 1 times [2025-02-05 16:30:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:42,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474638744] [2025-02-05 16:30:42,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:42,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:42,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:42,672 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:42,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:30:42,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-02-05 16:30:43,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-02-05 16:30:43,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:43,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:43,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:43,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:43,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:43,077 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474638744] [2025-02-05 16:30:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474638744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390023349] [2025-02-05 16:30:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:43,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:43,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:43,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:43,080 INFO L87 Difference]: Start difference. First operand 9853 states and 15976 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:43,228 INFO L93 Difference]: Finished difference Result 28607 states and 46208 transitions. [2025-02-05 16:30:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 467 [2025-02-05 16:30:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:43,277 INFO L225 Difference]: With dead ends: 28607 [2025-02-05 16:30:43,278 INFO L226 Difference]: Without dead ends: 19237 [2025-02-05 16:30:43,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:43,294 INFO L435 NwaCegarLoop]: 4118 mSDtfsCounter, 1964 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 6267 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:43,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 6267 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19237 states. [2025-02-05 16:30:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19237 to 10011. [2025-02-05 16:30:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10011 states, 10010 states have (on average 1.6197802197802198) internal successors, (16214), 10010 states have internal predecessors, (16214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 16214 transitions. [2025-02-05 16:30:43,578 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 16214 transitions. Word has length 467 [2025-02-05 16:30:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:43,579 INFO L471 AbstractCegarLoop]: Abstraction has 10011 states and 16214 transitions. [2025-02-05 16:30:43,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 16214 transitions. [2025-02-05 16:30:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-02-05 16:30:43,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:43,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:43,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 16:30:43,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:43,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:43,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1486872058, now seen corresponding path program 1 times [2025-02-05 16:30:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:43,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233963130] [2025-02-05 16:30:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:43,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:43,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:43,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:30:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-02-05 16:30:44,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-02-05 16:30:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:44,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:44,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:44,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:44,212 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233963130] [2025-02-05 16:30:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233963130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:44,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:44,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936476113] [2025-02-05 16:30:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:44,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:44,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:44,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:44,214 INFO L87 Difference]: Start difference. First operand 10011 states and 16214 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:44,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:44,282 INFO L93 Difference]: Finished difference Result 19595 states and 31626 transitions. [2025-02-05 16:30:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:44,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 468 [2025-02-05 16:30:44,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:44,308 INFO L225 Difference]: With dead ends: 19595 [2025-02-05 16:30:44,308 INFO L226 Difference]: Without dead ends: 10201 [2025-02-05 16:30:44,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:44,324 INFO L435 NwaCegarLoop]: 2193 mSDtfsCounter, 18 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:44,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4354 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2025-02-05 16:30:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 10201. [2025-02-05 16:30:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10201 states, 10200 states have (on average 1.6133333333333333) internal successors, (16456), 10200 states have internal predecessors, (16456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10201 states to 10201 states and 16456 transitions. [2025-02-05 16:30:44,507 INFO L78 Accepts]: Start accepts. Automaton has 10201 states and 16456 transitions. Word has length 468 [2025-02-05 16:30:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:44,508 INFO L471 AbstractCegarLoop]: Abstraction has 10201 states and 16456 transitions. [2025-02-05 16:30:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10201 states and 16456 transitions. [2025-02-05 16:30:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-05 16:30:44,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:44,531 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 16:30:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:44,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 310356944, now seen corresponding path program 1 times [2025-02-05 16:30:44,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:44,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749059825] [2025-02-05 16:30:44,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:44,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:44,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:44,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:44,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:30:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 16:30:45,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 16:30:45,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:45,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:45,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:45,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:45,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:45,377 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749059825] [2025-02-05 16:30:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749059825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:45,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916456284] [2025-02-05 16:30:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:45,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:45,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:45,380 INFO L87 Difference]: Start difference. First operand 10201 states and 16456 transitions. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:45,545 INFO L93 Difference]: Finished difference Result 29708 states and 47844 transitions. [2025-02-05 16:30:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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 469 [2025-02-05 16:30:45,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:45,581 INFO L225 Difference]: With dead ends: 29708 [2025-02-05 16:30:45,581 INFO L226 Difference]: Without dead ends: 20036 [2025-02-05 16:30:45,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 467 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:45,601 INFO L435 NwaCegarLoop]: 4200 mSDtfsCounter, 1875 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 6302 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:45,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 6302 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:30:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20036 states. [2025-02-05 16:30:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20036 to 20034. [2025-02-05 16:30:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20034 states, 20033 states have (on average 1.6056007587480656) internal successors, (32165), 20033 states have internal predecessors, (32165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 32165 transitions. [2025-02-05 16:30:45,974 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 32165 transitions. Word has length 469 [2025-02-05 16:30:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:45,975 INFO L471 AbstractCegarLoop]: Abstraction has 20034 states and 32165 transitions. [2025-02-05 16:30:45,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 32165 transitions. [2025-02-05 16:30:46,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-05 16:30:46,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:46,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:46,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 16:30:46,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:46,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -572608814, now seen corresponding path program 1 times [2025-02-05 16:30:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [675800709] [2025-02-05 16:30:46,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:46,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:46,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:46,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 16:30:46,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 16:30:46,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 16:30:46,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:46,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:46,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:30:46,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:46,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:46,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:46,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675800709] [2025-02-05 16:30:46,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675800709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:46,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:30:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794483034] [2025-02-05 16:30:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:30:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:46,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:30:46,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:30:46,765 INFO L87 Difference]: Start difference. First operand 20034 states and 32165 transitions. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:47,277 INFO L93 Difference]: Finished difference Result 68495 states and 110621 transitions. [2025-02-05 16:30:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:30:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 469 [2025-02-05 16:30:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:47,358 INFO L225 Difference]: With dead ends: 68495 [2025-02-05 16:30:47,358 INFO L226 Difference]: Without dead ends: 48542 [2025-02-05 16:30:47,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:30:47,387 INFO L435 NwaCegarLoop]: 3044 mSDtfsCounter, 7323 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7323 SdHoareTripleChecker+Valid, 7955 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:47,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7323 Valid, 7955 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:30:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48542 states. [2025-02-05 16:30:47,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48542 to 20242. [2025-02-05 16:30:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20242 states, 20241 states have (on average 1.606837606837607) internal successors, (32524), 20241 states have internal predecessors, (32524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20242 states to 20242 states and 32524 transitions. [2025-02-05 16:30:47,930 INFO L78 Accepts]: Start accepts. Automaton has 20242 states and 32524 transitions. Word has length 469 [2025-02-05 16:30:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:47,930 INFO L471 AbstractCegarLoop]: Abstraction has 20242 states and 32524 transitions. [2025-02-05 16:30:47,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 20242 states and 32524 transitions. [2025-02-05 16:30:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-02-05 16:30:47,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:47,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:47,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 16:30:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:48,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -927023449, now seen corresponding path program 1 times [2025-02-05 16:30:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [464023498] [2025-02-05 16:30:48,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:48,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:48,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 16:30:48,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-02-05 16:30:48,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-02-05 16:30:48,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:48,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:48,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:48,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:48,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:48,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464023498] [2025-02-05 16:30:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464023498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911888855] [2025-02-05 16:30:48,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:48,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:48,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:48,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:48,520 INFO L87 Difference]: Start difference. First operand 20242 states and 32524 transitions. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:48,753 INFO L93 Difference]: Finished difference Result 60493 states and 97142 transitions. [2025-02-05 16:30:48,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:48,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 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 472 [2025-02-05 16:30:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:48,811 INFO L225 Difference]: With dead ends: 60493 [2025-02-05 16:30:48,811 INFO L226 Difference]: Without dead ends: 40361 [2025-02-05 16:30:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:48,832 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 2085 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 6383 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:48,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2085 Valid, 6383 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40361 states. [2025-02-05 16:30:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40361 to 20331. [2025-02-05 16:30:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20331 states, 20330 states have (on average 1.606591244466306) internal successors, (32662), 20330 states have internal predecessors, (32662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20331 states to 20331 states and 32662 transitions. [2025-02-05 16:30:49,450 INFO L78 Accepts]: Start accepts. Automaton has 20331 states and 32662 transitions. Word has length 472 [2025-02-05 16:30:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:49,450 INFO L471 AbstractCegarLoop]: Abstraction has 20331 states and 32662 transitions. [2025-02-05 16:30:49,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 20331 states and 32662 transitions. [2025-02-05 16:30:49,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-02-05 16:30:49,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:49,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:49,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 16:30:49,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:49,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:49,689 INFO L85 PathProgramCache]: Analyzing trace with hash 2120635391, now seen corresponding path program 1 times [2025-02-05 16:30:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1234662097] [2025-02-05 16:30:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:49,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:49,695 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:49,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 16:30:49,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-02-05 16:30:50,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-02-05 16:30:50,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:50,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:50,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:50,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:50,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:50,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234662097] [2025-02-05 16:30:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234662097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391508607] [2025-02-05 16:30:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:50,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:50,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:50,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:50,104 INFO L87 Difference]: Start difference. First operand 20331 states and 32662 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:50,231 INFO L93 Difference]: Finished difference Result 60632 states and 97342 transitions. [2025-02-05 16:30:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 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 473 [2025-02-05 16:30:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:50,274 INFO L225 Difference]: With dead ends: 60632 [2025-02-05 16:30:50,274 INFO L226 Difference]: Without dead ends: 40496 [2025-02-05 16:30:50,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:50,300 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 2084 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 6387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:50,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 6387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40496 states. [2025-02-05 16:30:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40496 to 20466. [2025-02-05 16:30:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20466 states, 20465 states have (on average 1.6060591253359393) internal successors, (32868), 20465 states have internal predecessors, (32868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20466 states to 20466 states and 32868 transitions. [2025-02-05 16:30:50,727 INFO L78 Accepts]: Start accepts. Automaton has 20466 states and 32868 transitions. Word has length 473 [2025-02-05 16:30:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 20466 states and 32868 transitions. [2025-02-05 16:30:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20466 states and 32868 transitions. [2025-02-05 16:30:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-02-05 16:30:50,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:50,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:50,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 16:30:50,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:50,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:50,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1023920601, now seen corresponding path program 1 times [2025-02-05 16:30:50,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:50,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1862722502] [2025-02-05 16:30:50,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:50,957 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:50,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 16:30:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-02-05 16:30:51,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-02-05 16:30:51,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:51,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:51,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:51,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:51,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:51,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862722502] [2025-02-05 16:30:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862722502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:51,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654033297] [2025-02-05 16:30:51,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:51,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:51,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:51,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:51,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:51,429 INFO L87 Difference]: Start difference. First operand 20466 states and 32868 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:51,524 INFO L93 Difference]: Finished difference Result 40737 states and 65369 transitions. [2025-02-05 16:30:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:51,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 474 [2025-02-05 16:30:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:51,546 INFO L225 Difference]: With dead ends: 40737 [2025-02-05 16:30:51,546 INFO L226 Difference]: Without dead ends: 20610 [2025-02-05 16:30:51,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:51,567 INFO L435 NwaCegarLoop]: 2193 mSDtfsCounter, 18 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:51,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4354 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20610 states. [2025-02-05 16:30:51,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20610 to 20610. [2025-02-05 16:30:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20610 states, 20609 states have (on average 1.6034256878062982) internal successors, (33045), 20609 states have internal predecessors, (33045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20610 states to 20610 states and 33045 transitions. [2025-02-05 16:30:51,833 INFO L78 Accepts]: Start accepts. Automaton has 20610 states and 33045 transitions. Word has length 474 [2025-02-05 16:30:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:51,833 INFO L471 AbstractCegarLoop]: Abstraction has 20610 states and 33045 transitions. [2025-02-05 16:30:51,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:51,834 INFO L276 IsEmpty]: Start isEmpty. Operand 20610 states and 33045 transitions. [2025-02-05 16:30:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-02-05 16:30:51,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:51,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:51,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 16:30:52,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:52,061 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash 233804959, now seen corresponding path program 1 times [2025-02-05 16:30:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:52,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971879487] [2025-02-05 16:30:52,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:52,065 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:52,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 16:30:52,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-02-05 16:30:52,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-02-05 16:30:52,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:52,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:52,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:30:52,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:52,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:52,612 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971879487] [2025-02-05 16:30:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971879487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:30:52,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394473118] [2025-02-05 16:30:52,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:30:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:52,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:30:52,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:30:52,614 INFO L87 Difference]: Start difference. First operand 20610 states and 33045 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:53,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:53,361 INFO L93 Difference]: Finished difference Result 102119 states and 163714 transitions. [2025-02-05 16:30:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:30:53,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 475 [2025-02-05 16:30:53,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:53,449 INFO L225 Difference]: With dead ends: 102119 [2025-02-05 16:30:53,450 INFO L226 Difference]: Without dead ends: 81522 [2025-02-05 16:30:53,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:30:53,485 INFO L435 NwaCegarLoop]: 3284 mSDtfsCounter, 6909 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6909 SdHoareTripleChecker+Valid, 8415 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6909 Valid, 8415 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:30:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81522 states. [2025-02-05 16:30:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81522 to 40786. [2025-02-05 16:30:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40786 states, 40785 states have (on average 1.5964202525438274) internal successors, (65110), 40785 states have internal predecessors, (65110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40786 states to 40786 states and 65110 transitions. [2025-02-05 16:30:54,321 INFO L78 Accepts]: Start accepts. Automaton has 40786 states and 65110 transitions. Word has length 475 [2025-02-05 16:30:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:54,321 INFO L471 AbstractCegarLoop]: Abstraction has 40786 states and 65110 transitions. [2025-02-05 16:30:54,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:54,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40786 states and 65110 transitions. [2025-02-05 16:30:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 16:30:54,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:54,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:54,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 16:30:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:54,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:54,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:54,567 INFO L85 PathProgramCache]: Analyzing trace with hash -725665981, now seen corresponding path program 1 times [2025-02-05 16:30:54,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:54,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75845108] [2025-02-05 16:30:54,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:54,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:54,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:54,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:54,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 16:30:54,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 16:30:55,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 16:30:55,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:55,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:55,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:55,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:55,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:55,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75845108] [2025-02-05 16:30:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75845108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806343034] [2025-02-05 16:30:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:55,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:55,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:55,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:55,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:55,275 INFO L87 Difference]: Start difference. First operand 40786 states and 65110 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:55,682 INFO L93 Difference]: Finished difference Result 117938 states and 188237 transitions. [2025-02-05 16:30:55,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:55,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 477 [2025-02-05 16:30:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:55,761 INFO L225 Difference]: With dead ends: 117938 [2025-02-05 16:30:55,761 INFO L226 Difference]: Without dead ends: 80812 [2025-02-05 16:30:55,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:55,777 INFO L435 NwaCegarLoop]: 4176 mSDtfsCounter, 1913 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 6278 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:55,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1913 Valid, 6278 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:30:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80812 states. [2025-02-05 16:30:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80812 to 80810. [2025-02-05 16:30:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80810 states, 80809 states have (on average 1.5900580380898168) internal successors, (128491), 80809 states have internal predecessors, (128491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80810 states to 80810 states and 128491 transitions. [2025-02-05 16:30:56,811 INFO L78 Accepts]: Start accepts. Automaton has 80810 states and 128491 transitions. Word has length 477 [2025-02-05 16:30:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:30:56,812 INFO L471 AbstractCegarLoop]: Abstraction has 80810 states and 128491 transitions. [2025-02-05 16:30:56,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 80810 states and 128491 transitions. [2025-02-05 16:30:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 16:30:56,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:30:56,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:30:56,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 16:30:57,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:57,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:30:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:30:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 728673983, now seen corresponding path program 1 times [2025-02-05 16:30:57,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:30:57,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819732661] [2025-02-05 16:30:57,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:30:57,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:30:57,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:30:57,103 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:30:57,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 16:30:57,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 16:30:57,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 16:30:57,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:30:57,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:30:57,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:30:57,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:30:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:30:57,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:30:57,613 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:30:57,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819732661] [2025-02-05 16:30:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819732661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:30:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:30:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:30:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095062415] [2025-02-05 16:30:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:30:57,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:30:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:30:57,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:30:57,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:57,615 INFO L87 Difference]: Start difference. First operand 80810 states and 128491 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:30:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:30:58,313 INFO L93 Difference]: Finished difference Result 242333 states and 385297 transitions. [2025-02-05 16:30:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:30:58,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 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 478 [2025-02-05 16:30:58,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:30:58,478 INFO L225 Difference]: With dead ends: 242333 [2025-02-05 16:30:58,478 INFO L226 Difference]: Without dead ends: 161571 [2025-02-05 16:30:58,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:30:58,538 INFO L435 NwaCegarLoop]: 4294 mSDtfsCounter, 2145 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 6443 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:30:58,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 6443 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:30:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161571 states. [2025-02-05 16:31:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161571 to 80857. [2025-02-05 16:31:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80857 states, 80856 states have (on average 1.5900489759572574) internal successors, (128565), 80856 states have internal predecessors, (128565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80857 states to 80857 states and 128565 transitions. [2025-02-05 16:31:00,185 INFO L78 Accepts]: Start accepts. Automaton has 80857 states and 128565 transitions. Word has length 478 [2025-02-05 16:31:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:00,185 INFO L471 AbstractCegarLoop]: Abstraction has 80857 states and 128565 transitions. [2025-02-05 16:31:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 80857 states and 128565 transitions. [2025-02-05 16:31:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 16:31:00,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:00,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:00,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-05 16:31:00,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:00,460 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1932678681, now seen corresponding path program 1 times [2025-02-05 16:31:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:31:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122209923] [2025-02-05 16:31:00,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:00,465 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:00,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 16:31:00,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 16:31:00,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 16:31:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:00,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:31:00,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:01,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:01,224 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:31:01,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122209923] [2025-02-05 16:31:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122209923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:01,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:01,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941559453] [2025-02-05 16:31:01,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:01,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:01,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:31:01,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:01,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:01,226 INFO L87 Difference]: Start difference. First operand 80857 states and 128565 transitions. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:01,674 INFO L93 Difference]: Finished difference Result 234574 states and 372904 transitions. [2025-02-05 16:31:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:01,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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 479 [2025-02-05 16:31:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:01,850 INFO L225 Difference]: With dead ends: 234574 [2025-02-05 16:31:01,850 INFO L226 Difference]: Without dead ends: 158908 [2025-02-05 16:31:01,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:01,937 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 1905 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 6362 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:01,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 6362 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158908 states. [2025-02-05 16:31:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158908 to 158906. [2025-02-05 16:31:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158906 states, 158905 states have (on average 1.5835121613542682) internal successors, (251628), 158905 states have internal predecessors, (251628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158906 states to 158906 states and 251628 transitions. [2025-02-05 16:31:04,031 INFO L78 Accepts]: Start accepts. Automaton has 158906 states and 251628 transitions. Word has length 479 [2025-02-05 16:31:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 158906 states and 251628 transitions. [2025-02-05 16:31:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158906 states and 251628 transitions. [2025-02-05 16:31:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 16:31:04,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:04,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:04,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 16:31:04,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:04,794 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 939995916, now seen corresponding path program 1 times [2025-02-05 16:31:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:31:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551959924] [2025-02-05 16:31:04,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:04,800 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:04,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 16:31:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 16:31:05,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 16:31:05,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:05,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:05,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:31:05,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:05,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:05,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:31:05,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551959924] [2025-02-05 16:31:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551959924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793120714] [2025-02-05 16:31:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:05,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:05,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:31:05,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:05,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:05,152 INFO L87 Difference]: Start difference. First operand 158906 states and 251628 transitions. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:06,388 INFO L93 Difference]: Finished difference Result 476470 states and 754447 transitions. [2025-02-05 16:31:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 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 479 [2025-02-05 16:31:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:06,746 INFO L225 Difference]: With dead ends: 476470 [2025-02-05 16:31:06,746 INFO L226 Difference]: Without dead ends: 317704 [2025-02-05 16:31:06,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:06,875 INFO L435 NwaCegarLoop]: 4298 mSDtfsCounter, 2144 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 6447 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:06,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 6447 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317704 states. [2025-02-05 16:31:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317704 to 159004. [2025-02-05 16:31:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159004 states, 159003 states have (on average 1.583485846179003) internal successors, (251779), 159003 states have internal predecessors, (251779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159004 states to 159004 states and 251779 transitions. [2025-02-05 16:31:10,050 INFO L78 Accepts]: Start accepts. Automaton has 159004 states and 251779 transitions. Word has length 479 [2025-02-05 16:31:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,050 INFO L471 AbstractCegarLoop]: Abstraction has 159004 states and 251779 transitions. [2025-02-05 16:31:10,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand 159004 states and 251779 transitions. [2025-02-05 16:31:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 16:31:10,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:10,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 16:31:10,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:10,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:10,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1538165092, now seen corresponding path program 1 times [2025-02-05 16:31:10,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:31:10,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54061821] [2025-02-05 16:31:10,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:10,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:10,405 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:10,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 16:31:10,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 16:31:10,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 16:31:10,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:31:10,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:10,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:10,711 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:31:10,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54061821] [2025-02-05 16:31:10,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54061821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137946081] [2025-02-05 16:31:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:31:10,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:10,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:10,713 INFO L87 Difference]: Start difference. First operand 159004 states and 251779 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:11,680 INFO L93 Difference]: Finished difference Result 317905 states and 503357 transitions. [2025-02-05 16:31:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:11,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 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 480 [2025-02-05 16:31:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:11,881 INFO L225 Difference]: With dead ends: 317905 [2025-02-05 16:31:11,882 INFO L226 Difference]: Without dead ends: 159121 [2025-02-05 16:31:12,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:12,014 INFO L435 NwaCegarLoop]: 2193 mSDtfsCounter, 18 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4354 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:12,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4354 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159121 states. [2025-02-05 16:31:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159121 to 159121. [2025-02-05 16:31:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159121 states, 159120 states have (on average 1.5832390648567118) internal successors, (251925), 159120 states have internal predecessors, (251925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159121 states to 159121 states and 251925 transitions. [2025-02-05 16:31:14,358 INFO L78 Accepts]: Start accepts. Automaton has 159121 states and 251925 transitions. Word has length 480 [2025-02-05 16:31:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:14,358 INFO L471 AbstractCegarLoop]: Abstraction has 159121 states and 251925 transitions. [2025-02-05 16:31:14,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 159121 states and 251925 transitions. [2025-02-05 16:31:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 16:31:14,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:14,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:14,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-05 16:31:14,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:14,738 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:14,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash -656083030, now seen corresponding path program 1 times [2025-02-05 16:31:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:31:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646870603] [2025-02-05 16:31:14,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:14,741 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:14,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 16:31:14,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 16:31:15,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 16:31:15,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 16:31:15,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:15,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:15,786 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:31:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646870603] [2025-02-05 16:31:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646870603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474048499] [2025-02-05 16:31:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:31:15,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:15,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:15,788 INFO L87 Difference]: Start difference. First operand 159121 states and 251925 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:16,747 INFO L93 Difference]: Finished difference Result 456726 states and 722972 transitions. [2025-02-05 16:31:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:16,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 481 [2025-02-05 16:31:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:17,745 INFO L225 Difference]: With dead ends: 456726 [2025-02-05 16:31:17,745 INFO L226 Difference]: Without dead ends: 310332 [2025-02-05 16:31:17,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:17,820 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 1898 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 6362 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:17,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 6362 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310332 states. [2025-02-05 16:31:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310332 to 310330. [2025-02-05 16:31:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310330 states, 310329 states have (on average 1.5766750770955986) internal successors, (489288), 310329 states have internal predecessors, (489288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:22,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310330 states to 310330 states and 489288 transitions. [2025-02-05 16:31:22,843 INFO L78 Accepts]: Start accepts. Automaton has 310330 states and 489288 transitions. Word has length 481 [2025-02-05 16:31:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:22,843 INFO L471 AbstractCegarLoop]: Abstraction has 310330 states and 489288 transitions. [2025-02-05 16:31:22,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 310330 states and 489288 transitions. [2025-02-05 16:31:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 16:31:23,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:23,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-05 16:31:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:23,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:23,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1081204308, now seen corresponding path program 1 times [2025-02-05 16:31:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 16:31:23,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804103406] [2025-02-05 16:31:23,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:23,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:23,334 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:31:23,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 16:31:24,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 16:31:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 16:31:24,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:24,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:24,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 1115 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 16:31:24,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:24,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 16:31:24,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 16:31:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804103406] [2025-02-05 16:31:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804103406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810350850] [2025-02-05 16:31:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:24,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:31:24,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 16:31:24,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:31:24,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:31:24,601 INFO L87 Difference]: Start difference. First operand 310330 states and 489288 transitions. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:27,092 INFO L93 Difference]: Finished difference Result 915186 states and 1442332 transitions. [2025-02-05 16:31:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:27,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 481 [2025-02-05 16:31:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:28,719 INFO L225 Difference]: With dead ends: 915186 [2025-02-05 16:31:28,720 INFO L226 Difference]: Without dead ends: 609588 [2025-02-05 16:31:28,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 478 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:28,907 INFO L435 NwaCegarLoop]: 3304 mSDtfsCounter, 2012 mSDsluCounter, 5121 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 8425 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:28,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 8425 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609588 states.