./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:54,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:54,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:22:54,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:54,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:54,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:54,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:54,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:54,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:54,364 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:54,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:54,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:54,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:54,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:54,364 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:54,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:54,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:54,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:54,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:54,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:54,367 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:54,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:54,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:54,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:54,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:54,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:54,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:54,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:54,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:54,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:54,370 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 -> 8381803db0f296b6c475c94ca7dd8f9a2c79c383b82b37638a653c8556f3f15c [2025-02-07 21:22:54,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:54,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:54,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:54,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:54,663 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:54,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:22:55,989 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f1790de/f4c0ee5c4657413e88d99eecdda87afb/FLAG50fdebfae [2025-02-07 21:22:56,354 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:56,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:22:56,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f1790de/f4c0ee5c4657413e88d99eecdda87afb/FLAG50fdebfae [2025-02-07 21:22:56,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3f1790de/f4c0ee5c4657413e88d99eecdda87afb [2025-02-07 21:22:56,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:56,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:56,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:56,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:56,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:56,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:56" (1/1) ... [2025-02-07 21:22:56,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef1ad77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:56, skipping insertion in model container [2025-02-07 21:22:56,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:56" (1/1) ... [2025-02-07 21:22:56,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:56,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2025-02-07 21:22:56,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2025-02-07 21:22:56,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2025-02-07 21:22:56,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2025-02-07 21:22:56,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2025-02-07 21:22:56,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2025-02-07 21:22:56,859 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2025-02-07 21:22:56,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2025-02-07 21:22:56,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2025-02-07 21:22:56,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2025-02-07 21:22:56,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2025-02-07 21:22:56,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2025-02-07 21:22:56,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2025-02-07 21:22:56,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2025-02-07 21:22:56,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2025-02-07 21:22:56,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2025-02-07 21:22:57,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:57,113 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:57,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11561,11574] [2025-02-07 21:22:57,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15618,15631] [2025-02-07 21:22:57,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16839,16852] [2025-02-07 21:22:57,247 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17545,17558] [2025-02-07 21:22:57,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19131,19144] [2025-02-07 21:22:57,270 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19837,19850] [2025-02-07 21:22:57,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20908,20921] [2025-02-07 21:22:57,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23398,23411] [2025-02-07 21:22:57,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24107,24120] [2025-02-07 21:22:57,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25144,25157] [2025-02-07 21:22:57,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27082,27095] [2025-02-07 21:22:57,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31116,31129] [2025-02-07 21:22:57,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31825,31838] [2025-02-07 21:22:57,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32899,32912] [2025-02-07 21:22:57,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34874,34887] [2025-02-07 21:22:57,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38255,38268] [2025-02-07 21:22:57,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:57,491 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:57,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57 WrapperNode [2025-02-07 21:22:57,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:57,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:57,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:57,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:57,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,641 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3756 [2025-02-07 21:22:57,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:57,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:57,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:57,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:57,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,712 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-07 21:22:57,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,750 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:57,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:57,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:57,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:57,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (1/1) ... [2025-02-07 21:22:57,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:57,842 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-07 21:22:57,844 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-07 21:22:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:57,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:57,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:58,055 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:58,057 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:23:00,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3537: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-02-07 21:23:00,215 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2150: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4595: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1689: havoc main_~check__tmp~13#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3143: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5193: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5061: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~node5__m5~1#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3741: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3609: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5130: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: havoc main_~node3__m3~4#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5659: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1167: havoc main_~node5__m5~4#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762: havoc main_~node5__m5~8#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3678: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4207: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L772: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5265: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-02-07 21:23:00,216 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1897: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3813: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2624: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2558: havoc main_~node3__m3~5#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832: havoc main_~check__tmp~15#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2229: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1040: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1305: havoc main_~node5__m5~5#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2__m2~2#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4477: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2099: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4414: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4943: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1376: havoc main_~check__tmp~9#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3491: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-07 21:23:00,217 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret25#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node5__m5~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node5__m5~3#1, main_~node4__m4~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~18#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~main____CPAchecker_TMP_0~20#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~21#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~26#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~main____CPAchecker_TMP_0~28#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~29#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~main____CPAchecker_TMP_0~32#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~main____CPAchecker_TMP_0~33#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4549: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5541: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2040: havoc main_~node4__m4~6#1; [2025-02-07 21:23:00,220 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3097: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-02-07 21:23:00,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2899: havoc main_~node5__m5~17#1; [2025-02-07 21:23:00,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4089: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-02-07 21:23:00,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5147: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-02-07 21:23:00,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5478: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:23:00,221 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3695: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: havoc main_~node2__m2~1#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4026: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: havoc main_~node4__m4~8#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5613: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~node3__m3~3#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4161: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_~node3__m3~2#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4825: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-07 21:23:00,222 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L862: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1655: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3373: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4431: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: havoc main_~node5__m5~3#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4762: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5357: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1526: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3310: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1262: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc main_~node5__m5~10#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3905: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3445: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2322: havoc main_~node4__m4~7#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3__m3~1#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc main_~node5__m5~14#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5495: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5429: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2193: havoc main_~node5__m5~11#1; [2025-02-07 21:23:00,223 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4043: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3977: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1467: havoc main_~node4__m4~4#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1798: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: havoc main_~node4__m4~2#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2658: havoc main_~check__tmp~25#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4641: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: havoc main_~check__tmp~20#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3189: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1341: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4380: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1211: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4713: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:23:00,224 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3327: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3261: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2337: havoc main_~node5__m5~12#1; [2025-02-07 21:23:00,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4253: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-07 21:23:00,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~node4__m4~9#1; [2025-02-07 21:23:00,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: havoc main_~node4__m4~1#1; [2025-02-07 21:23:00,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5311: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-02-07 21:23:00,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5113: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:23:00,228 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3859: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3661: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: havoc main_~node2__m2~3#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: havoc main_~node5__m5~6#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2473: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1152: havoc main_~node4__m4~3#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: havoc main_~node4__m4~5#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5777: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc main_~node5__m5~2#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: havoc main_~check__tmp~22#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4325: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-07 21:23:00,229 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~node5__m5~7#1; [2025-02-07 21:23:00,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:23:00,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4989: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-07 21:23:00,230 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:23:00,394 INFO L? ?]: Removed 982 outVars from TransFormulas that were not future-live. [2025-02-07 21:23:00,394 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:23:00,428 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:23:00,428 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:23:00,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:00 BoogieIcfgContainer [2025-02-07 21:23:00,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:23:00,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:23:00,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:23:00,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:23:00,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:56" (1/3) ... [2025-02-07 21:23:00,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3654e0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:23:00, skipping insertion in model container [2025-02-07 21:23:00,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:57" (2/3) ... [2025-02-07 21:23:00,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3654e0a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:23:00, skipping insertion in model container [2025-02-07 21:23:00,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:00" (3/3) ... [2025-02-07 21:23:00,441 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:23:00,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:23:00,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c that has 1 procedures, 630 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 21:23:00,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:23:00,552 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;@4008dcc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:23:00,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 21:23:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 520 states have (on average 1.998076923076923) internal successors, (1039), 628 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:00,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:00,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:00,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:00,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:00,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1994619948, now seen corresponding path program 1 times [2025-02-07 21:23:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097321888] [2025-02-07 21:23:00,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:00,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:00,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:00,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:00,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:02,348 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-07 21:23:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097321888] [2025-02-07 21:23:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097321888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:23:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154015301] [2025-02-07 21:23:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:02,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:23:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:02,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:23:02,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:23:02,380 INFO L87 Difference]: Start difference. First operand has 629 states, 520 states have (on average 1.998076923076923) internal successors, (1039), 628 states have internal predecessors, (1039), 0 states have call successors, (0), 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 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:03,400 INFO L93 Difference]: Finished difference Result 647 states and 1039 transitions. [2025-02-07 21:23:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:23:03,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:03,411 INFO L225 Difference]: With dead ends: 647 [2025-02-07 21:23:03,413 INFO L226 Difference]: Without dead ends: 202 [2025-02-07 21:23:03,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:03,421 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 4378 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4378 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:03,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4378 Valid, 4149 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:23:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-07 21:23:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-07 21:23:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 190 states have (on average 1.0578947368421052) internal successors, (201), 201 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 201 transitions. [2025-02-07 21:23:03,461 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 201 transitions. Word has length 75 [2025-02-07 21:23:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:03,462 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 201 transitions. [2025-02-07 21:23:03,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:03,462 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 201 transitions. [2025-02-07 21:23:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:03,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:03,464 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] [2025-02-07 21:23:03,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:23:03,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:03,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1910263825, now seen corresponding path program 1 times [2025-02-07 21:23:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:03,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624276014] [2025-02-07 21:23:03,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:03,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:03,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:03,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:05,429 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-07 21:23:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:05,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624276014] [2025-02-07 21:23:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624276014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:05,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:05,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:23:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178705560] [2025-02-07 21:23:05,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:23:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:05,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:23:05,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:05,432 INFO L87 Difference]: Start difference. First operand 202 states and 201 transitions. Second operand has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:07,428 INFO L93 Difference]: Finished difference Result 202 states and 201 transitions. [2025-02-07 21:23:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 21:23:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:07,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:07,430 INFO L225 Difference]: With dead ends: 202 [2025-02-07 21:23:07,430 INFO L226 Difference]: Without dead ends: 176 [2025-02-07 21:23:07,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=291, Invalid=1431, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 21:23:07,431 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 684 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:07,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1478 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:23:07,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-07 21:23:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-02-07 21:23:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 167 states have (on average 1.0479041916167664) internal successors, (175), 175 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 175 transitions. [2025-02-07 21:23:07,439 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 175 transitions. Word has length 75 [2025-02-07 21:23:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 175 transitions. [2025-02-07 21:23:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.260869565217391) internal successors, (75), 22 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 175 transitions. [2025-02-07 21:23:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:07,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:07,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:07,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:23:07,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:07,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:07,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1713338733, now seen corresponding path program 1 times [2025-02-07 21:23:07,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634081752] [2025-02-07 21:23:07,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:07,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:07,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:07,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:07,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:07,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:08,082 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-07 21:23:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634081752] [2025-02-07 21:23:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634081752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107859061] [2025-02-07 21:23:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:08,085 INFO L87 Difference]: Start difference. First operand 176 states and 175 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:08,562 INFO L93 Difference]: Finished difference Result 176 states and 175 transitions. [2025-02-07 21:23:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:08,563 INFO L225 Difference]: With dead ends: 176 [2025-02-07 21:23:08,563 INFO L226 Difference]: Without dead ends: 171 [2025-02-07 21:23:08,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:08,564 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 489 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:08,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 889 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:23:08,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-07 21:23:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-07 21:23:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.0429447852760736) internal successors, (170), 170 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 170 transitions. [2025-02-07 21:23:08,578 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 170 transitions. Word has length 75 [2025-02-07 21:23:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:08,579 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 170 transitions. [2025-02-07 21:23:08,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 170 transitions. [2025-02-07 21:23:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:08,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:08,582 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] [2025-02-07 21:23:08,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:23:08,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:08,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash -760666407, now seen corresponding path program 1 times [2025-02-07 21:23:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817222608] [2025-02-07 21:23:08,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:08,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:08,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:09,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817222608] [2025-02-07 21:23:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817222608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:09,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:09,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:23:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836266347] [2025-02-07 21:23:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:09,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:23:09,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:09,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:23:09,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:23:09,229 INFO L87 Difference]: Start difference. First operand 171 states and 170 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:09,705 INFO L93 Difference]: Finished difference Result 171 states and 170 transitions. [2025-02-07 21:23:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:23:09,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:09,707 INFO L225 Difference]: With dead ends: 171 [2025-02-07 21:23:09,707 INFO L226 Difference]: Without dead ends: 157 [2025-02-07 21:23:09,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:09,708 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 300 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:09,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1008 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-07 21:23:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-07 21:23:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 150 states have (on average 1.04) internal successors, (156), 156 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 156 transitions. [2025-02-07 21:23:09,721 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 156 transitions. Word has length 75 [2025-02-07 21:23:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:09,721 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 156 transitions. [2025-02-07 21:23:09,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 156 transitions. [2025-02-07 21:23:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:09,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:09,722 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] [2025-02-07 21:23:09,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:23:09,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:09,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash 138379918, now seen corresponding path program 1 times [2025-02-07 21:23:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491240775] [2025-02-07 21:23:09,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:09,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:11,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491240775] [2025-02-07 21:23:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491240775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:23:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035187340] [2025-02-07 21:23:11,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:11,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 21:23:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:11,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 21:23:11,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2025-02-07 21:23:11,641 INFO L87 Difference]: Start difference. First operand 157 states and 156 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:13,469 INFO L93 Difference]: Finished difference Result 157 states and 156 transitions. [2025-02-07 21:23:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 21:23:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:13,470 INFO L225 Difference]: With dead ends: 157 [2025-02-07 21:23:13,470 INFO L226 Difference]: Without dead ends: 152 [2025-02-07 21:23:13,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=457, Invalid=2195, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 21:23:13,472 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 495 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:13,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1643 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 21:23:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-07 21:23:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-07 21:23:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 146 states have (on average 1.0342465753424657) internal successors, (151), 151 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 151 transitions. [2025-02-07 21:23:13,485 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 151 transitions. Word has length 75 [2025-02-07 21:23:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:13,486 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 151 transitions. [2025-02-07 21:23:13,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 151 transitions. [2025-02-07 21:23:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:13,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:13,486 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] [2025-02-07 21:23:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:23:13,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:13,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1958115216, now seen corresponding path program 1 times [2025-02-07 21:23:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:13,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041700639] [2025-02-07 21:23:13,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:13,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:13,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:13,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:13,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:13,950 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-07 21:23:13,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:13,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041700639] [2025-02-07 21:23:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041700639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:13,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 21:23:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337968094] [2025-02-07 21:23:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:23:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:13,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:23:13,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:23:13,951 INFO L87 Difference]: Start difference. First operand 152 states and 151 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:14,265 INFO L93 Difference]: Finished difference Result 152 states and 151 transitions. [2025-02-07 21:23:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:23:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-02-07 21:23:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:14,267 INFO L225 Difference]: With dead ends: 152 [2025-02-07 21:23:14,267 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 21:23:14,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:23:14,270 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 336 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:14,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 444 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 21:23:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-07 21:23:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 113 transitions. [2025-02-07 21:23:14,278 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 113 transitions. Word has length 75 [2025-02-07 21:23:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 113 transitions. [2025-02-07 21:23:14,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 113 transitions. [2025-02-07 21:23:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:23:14,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:14,279 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] [2025-02-07 21:23:14,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:23:14,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1101481696, now seen corresponding path program 1 times [2025-02-07 21:23:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799982840] [2025-02-07 21:23:14,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:14,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:23:14,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:23:14,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:14,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:15,863 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-07 21:23:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799982840] [2025-02-07 21:23:15,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799982840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:15,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:15,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:23:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382395646] [2025-02-07 21:23:15,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:23:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:15,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:23:15,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:23:15,866 INFO L87 Difference]: Start difference. First operand 114 states and 113 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:17,203 INFO L93 Difference]: Finished difference Result 114 states and 113 transitions. [2025-02-07 21:23:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 21:23:17,204 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 21:23:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:17,204 INFO L225 Difference]: With dead ends: 114 [2025-02-07 21:23:17,204 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 21:23:17,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 21:23:17,206 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 339 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:17,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 913 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:23:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 21:23:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-07 21:23:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 103 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 103 transitions. [2025-02-07 21:23:17,209 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 103 transitions. Word has length 76 [2025-02-07 21:23:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 103 transitions. [2025-02-07 21:23:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 103 transitions. [2025-02-07 21:23:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:23:17,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:17,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:17,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:23:17,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 657484254, now seen corresponding path program 1 times [2025-02-07 21:23:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773190586] [2025-02-07 21:23:17,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:17,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:23:17,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:23:17,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:17,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:17,672 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-07 21:23:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:17,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773190586] [2025-02-07 21:23:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773190586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:17,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:17,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423793656] [2025-02-07 21:23:17,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:17,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:17,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:17,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:17,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:17,675 INFO L87 Difference]: Start difference. First operand 104 states and 103 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:18,021 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2025-02-07 21:23:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 21:23:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:18,022 INFO L225 Difference]: With dead ends: 104 [2025-02-07 21:23:18,022 INFO L226 Difference]: Without dead ends: 97 [2025-02-07 21:23:18,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:18,023 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 234 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:18,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 469 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-07 21:23:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-07 21:23:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0) internal successors, (96), 96 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 96 transitions. [2025-02-07 21:23:18,026 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 96 transitions. Word has length 76 [2025-02-07 21:23:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:18,027 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 96 transitions. [2025-02-07 21:23:18,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 96 transitions. [2025-02-07 21:23:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-07 21:23:18,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:18,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:18,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:23:18,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1892328298, now seen corresponding path program 1 times [2025-02-07 21:23:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589028584] [2025-02-07 21:23:18,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:18,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:18,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-07 21:23:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-07 21:23:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:18,095 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-07 21:23:18,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589028584] [2025-02-07 21:23:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589028584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:23:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720216187] [2025-02-07 21:23:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:23:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:18,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:23:18,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:23:18,098 INFO L87 Difference]: Start difference. First operand 97 states and 96 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:18,111 INFO L93 Difference]: Finished difference Result 97 states and 96 transitions. [2025-02-07 21:23:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:23:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-07 21:23:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:18,112 INFO L225 Difference]: With dead ends: 97 [2025-02-07 21:23:18,112 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:23:18,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:23:18,114 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:18,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:23:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:23:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:23:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:23:18,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2025-02-07 21:23:18,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:23:18,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:18,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:23:18,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:23:18,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 21:23:18,118 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 21:23:18,119 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 21:23:18,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 21:23:18,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:23:18,123 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:18,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:23:18,131 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:23:18,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:23:18 BoogieIcfgContainer [2025-02-07 21:23:18,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:23:18,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:23:18,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:23:18,142 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:23:18,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:23:00" (3/4) ... [2025-02-07 21:23:18,144 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:23:18,193 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:23:18,198 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:23:18,202 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:23:18,206 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:23:18,440 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:23:18,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:23:18,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:23:18,442 INFO L158 Benchmark]: Toolchain (without parser) took 22057.17ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.5MB in the beginning and 157.4MB in the end (delta: -47.9MB). Peak memory consumption was 227.0MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1107.34ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 47.5MB in the end (delta: 62.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.82ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 100.1MB in the end (delta: -52.6MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: Boogie Preprocessor took 148.91ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 87.9MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: IcfgBuilder took 2636.20ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 75.8MB in the end (delta: 12.0MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,442 INFO L158 Benchmark]: TraceAbstraction took 17710.67ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.8MB in the beginning and 195.1MB in the end (delta: -120.3MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,443 INFO L158 Benchmark]: Witness Printer took 299.07ms. Allocated memory is still 419.4MB. Free memory was 195.1MB in the beginning and 157.4MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:23:18,444 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.95ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1107.34ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 47.5MB in the end (delta: 62.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.82ms. Allocated memory is still 142.6MB. Free memory was 47.5MB in the beginning and 100.1MB in the end (delta: -52.6MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.91ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 87.9MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 2636.20ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 75.8MB in the end (delta: 12.0MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 17710.67ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.8MB in the beginning and 195.1MB in the end (delta: -120.3MB). Peak memory consumption was 157.5MB. Max. memory is 16.1GB. * Witness Printer took 299.07ms. Allocated memory is still 419.4MB. Free memory was 195.1MB in the beginning and 157.4MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 614]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 955]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1047]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1098]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1218]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1269]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1348]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1533]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1584]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1662]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1805]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2106]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2157]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2236]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2380]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 2631]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 630 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7255 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7255 mSDsluCounter, 11170 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9480 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4060 IncrementalHoareTripleChecker+Invalid, 4109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 1690 mSDtfsCounter, 4060 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1286 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=0, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 15865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:23:18,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE