./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:50,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:50,050 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:50,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:50,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:50,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:50,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:50,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:50,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:50,077 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:50,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:50,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:50,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:50,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:50,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:50,080 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:50,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:50,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:50,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:50,081 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:50,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:50,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:50,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:50,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:50,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:50,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:50,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:50,082 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 -> dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 [2025-02-07 21:22:50,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:50,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:50,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:50,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:50,397 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:50,398 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:51,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7efcae5d8/534e92026340473093493d26f74da7ac/FLAG68b356791 [2025-02-07 21:22:51,873 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:51,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:51,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7efcae5d8/534e92026340473093493d26f74da7ac/FLAG68b356791 [2025-02-07 21:22:52,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7efcae5d8/534e92026340473093493d26f74da7ac [2025-02-07 21:22:52,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:52,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:52,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:52,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:52,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:52,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:52" (1/1) ... [2025-02-07 21:22:52,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721f17ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:52, skipping insertion in model container [2025-02-07 21:22:52,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:52" (1/1) ... [2025-02-07 21:22:52,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:52,473 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2025-02-07 21:22:52,492 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2025-02-07 21:22:52,501 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2025-02-07 21:22:52,509 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2025-02-07 21:22:52,514 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2025-02-07 21:22:52,520 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2025-02-07 21:22:52,523 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2025-02-07 21:22:52,532 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2025-02-07 21:22:52,534 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2025-02-07 21:22:52,538 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2025-02-07 21:22:52,544 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2025-02-07 21:22:52,561 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2025-02-07 21:22:52,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2025-02-07 21:22:52,568 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2025-02-07 21:22:52,574 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2025-02-07 21:22:52,583 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2025-02-07 21:22:52,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:52,717 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:52,773 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2025-02-07 21:22:52,785 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2025-02-07 21:22:52,791 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2025-02-07 21:22:52,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2025-02-07 21:22:52,801 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2025-02-07 21:22:52,803 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2025-02-07 21:22:52,810 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2025-02-07 21:22:52,817 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2025-02-07 21:22:52,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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2025-02-07 21:22:52,822 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2025-02-07 21:22:52,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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2025-02-07 21:22:52,832 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2025-02-07 21:22:52,834 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2025-02-07 21:22:52,836 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2025-02-07 21:22:52,839 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2025-02-07 21:22:52,844 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2025-02-07 21:22:52,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:52,915 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:52,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:52 WrapperNode [2025-02-07 21:22:52,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:52,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:52,917 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:52,917 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:52,922 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:52" (1/1) ... [2025-02-07 21:22:52,942 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:52" (1/1) ... [2025-02-07 21:22:53,000 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3579 [2025-02-07 21:22:53,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:53,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:53,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:53,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:53,008 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:52" (1/1) ... [2025-02-07 21:22:53,009 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:52" (1/1) ... [2025-02-07 21:22:53,022 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:52" (1/1) ... [2025-02-07 21:22:53,075 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:53,075 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:52" (1/1) ... [2025-02-07 21:22:53,076 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:52" (1/1) ... [2025-02-07 21:22:53,118 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:52" (1/1) ... [2025-02-07 21:22:53,122 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:52" (1/1) ... [2025-02-07 21:22:53,129 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:52" (1/1) ... [2025-02-07 21:22:53,135 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:52" (1/1) ... [2025-02-07 21:22:53,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:53,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:53,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:53,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:53,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:52" (1/1) ... [2025-02-07 21:22:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:53,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:53,213 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:53,216 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:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:53,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:53,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:53,387 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:53,389 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4000: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5190: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4069: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1427: havoc main_~node3__m3~3#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node2__m2~2#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2552: havoc main_~node5__m5~14#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4534: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5526: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4998: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:22:55,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2686: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc main_~node4__m4~7#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2026: havoc main_~node5__m5~10#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1630: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4603: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2622: havoc main_~check__tmp~25#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4340: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5068: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4870: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:22:55,066 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: 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_~__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_~__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_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#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_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#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_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#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_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#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_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#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_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#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_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#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_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#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_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#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_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#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_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#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_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#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_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#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_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#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_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#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_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#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:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2163: havoc main_~node5__m5~11#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3947: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: havoc main_~node5__m5~3#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5137: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4939: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1240: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4676: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2761: havoc main_~node4__m4~9#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5404: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2233: havoc main_~check__tmp~20#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc main_~node2__m2~1#1; [2025-02-07 21:22:55,067 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L847: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1772: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442: havoc main_~node4__m4~4#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3094: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5473: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3822: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2305: havoc main_~node5__m5~12#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3891: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5015: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3628: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4289: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4158: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1318: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:22:55,068 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc main_~check__tmp~22#1; [2025-02-07 21:22:55,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:22:55,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4227: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-07 21:22:55,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1981: havoc main_~node2__m2~3#1; [2025-02-07 21:22:55,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:22:55,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1189: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:22:55,072 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3964: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3041: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L927: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~1#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L796: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: havoc main_~node4__m4~5#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~node5__m5~6#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc main_~node4__m4~2#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3308: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4498: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5226: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1130: havoc main_~node4__m4~3#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2121: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3377: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1594: havoc main_~node5__m5~7#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5295: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5032: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4834: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2522: havoc main_~node3__m3~5#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4306: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: havoc main_~check__tmp~13#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5562: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: havoc main_~node3__m3~4#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5631: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4376: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5368: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2858: havoc main_~node5__m5~17#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L414: havoc main_~node4__m4~1#1; [2025-02-07 21:22:55,073 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3255: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1736: havoc main_~node5__m5~8#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4445: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2199: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1870: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3786: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4712: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1145: havoc main_~node5__m5~4#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2070: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806: havoc main_~check__tmp~15#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4781: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3130: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4122: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2801: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3594: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2537: havoc main_~node4__m4~8#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1282: havoc main_~node5__m5~5#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~node4__m4~6#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3664: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3466: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1352: havoc main_~check__tmp~9#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:22:55,074 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1552: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:22:55,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2025-02-07 21:22:55,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:22:55,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3733: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-02-07 21:22:55,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-02-07 21:22:55,075 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4659: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:22:55,076 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3272: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-02-07 21:22:55,203 INFO L? ?]: Removed 891 outVars from TransFormulas that were not future-live. [2025-02-07 21:22:55,203 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:22:55,218 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:22:55,218 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:22:55,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:55 BoogieIcfgContainer [2025-02-07 21:22:55,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:22:55,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:22:55,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:22:55,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:22:55,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:52" (1/3) ... [2025-02-07 21:22:55,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d57bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:55, skipping insertion in model container [2025-02-07 21:22:55,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:52" (2/3) ... [2025-02-07 21:22:55,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d57bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:55, skipping insertion in model container [2025-02-07 21:22:55,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:55" (3/3) ... [2025-02-07 21:22:55,225 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:55,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:22:55,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.UNBOUNDED.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:22:55,301 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:22:55,309 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;@79d0c51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:22:55,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 21:22:55,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 519 states have (on average 1.998073217726397) internal successors, (1037), 628 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states 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:22:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:22:55,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:55,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:55,331 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:22:55,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:55,336 INFO L85 PathProgramCache]: Analyzing trace with hash 351905829, now seen corresponding path program 1 times [2025-02-07 21:22:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176901758] [2025-02-07 21:22:55,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:55,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:22:55,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:22:55,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:55,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176901758] [2025-02-07 21:22:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176901758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:56,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026396079] [2025-02-07 21:22:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:56,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:56,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:56,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:56,701 INFO L87 Difference]: Start difference. First operand has 629 states, 519 states have (on average 1.998073217726397) internal successors, (1037), 628 states have internal predecessors, (1037), 0 states have call successors, (0), 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.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:22:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:57,367 INFO L93 Difference]: Finished difference Result 647 states and 1037 transitions. [2025-02-07 21:22:57,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:57,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:22:57,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:57,374 INFO L225 Difference]: With dead ends: 647 [2025-02-07 21:22:57,374 INFO L226 Difference]: Without dead ends: 201 [2025-02-07 21:22:57,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:57,379 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 4364 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4364 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:57,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4364 Valid, 4147 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:57,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-07 21:22:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-07 21:22:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 189 states have (on average 1.0582010582010581) internal successors, (200), 200 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:22:57,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 200 transitions. [2025-02-07 21:22:57,406 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 200 transitions. Word has length 74 [2025-02-07 21:22:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:57,407 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 200 transitions. [2025-02-07 21:22:57,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:22:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 200 transitions. [2025-02-07 21:22:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:22:57,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:57,409 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] [2025-02-07 21:22:57,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:22:57,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 70624583, now seen corresponding path program 1 times [2025-02-07 21:22:57,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:57,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769808035] [2025-02-07 21:22:57,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:57,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:22:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:22:57,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:57,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:58,037 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:22:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769808035] [2025-02-07 21:22:58,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769808035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:58,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:58,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:22:58,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399112414] [2025-02-07 21:22:58,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:58,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:22:58,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:58,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:22:58,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:22:58,039 INFO L87 Difference]: Start difference. First operand 201 states and 200 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:22:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:58,487 INFO L93 Difference]: Finished difference Result 201 states and 200 transitions. [2025-02-07 21:22:58,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:22:58,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:22:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:58,488 INFO L225 Difference]: With dead ends: 201 [2025-02-07 21:22:58,488 INFO L226 Difference]: Without dead ends: 196 [2025-02-07 21:22:58,489 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:22:58,489 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 603 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:58,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 760 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-07 21:22:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-07 21:22:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 185 states have (on average 1.054054054054054) internal successors, (195), 195 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:22:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 195 transitions. [2025-02-07 21:22:58,495 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 195 transitions. Word has length 74 [2025-02-07 21:22:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 195 transitions. [2025-02-07 21:22:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:22:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 195 transitions. [2025-02-07 21:22:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:22:58,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:58,497 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] [2025-02-07 21:22:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:22:58,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:58,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:58,498 INFO L85 PathProgramCache]: Analyzing trace with hash 741989321, now seen corresponding path program 1 times [2025-02-07 21:22:58,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093980593] [2025-02-07 21:22:58,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:58,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:22:58,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:22:58,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:58,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:00,114 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:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:00,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093980593] [2025-02-07 21:23:00,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093980593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:00,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:00,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-02-07 21:23:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266317917] [2025-02-07 21:23:00,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:00,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 21:23:00,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:00,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 21:23:00,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2025-02-07 21:23:00,116 INFO L87 Difference]: Start difference. First operand 196 states and 195 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:02,355 INFO L93 Difference]: Finished difference Result 196 states and 195 transitions. [2025-02-07 21:23:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-07 21:23:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:23:02,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:02,357 INFO L225 Difference]: With dead ends: 196 [2025-02-07 21:23:02,357 INFO L226 Difference]: Without dead ends: 170 [2025-02-07 21:23:02,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=375, Invalid=1787, Unknown=0, NotChecked=0, Total=2162 [2025-02-07 21:23:02,359 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 609 mSDsluCounter, 1383 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:02,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1493 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:23:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-07 21:23:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-07 21:23:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.0432098765432098) internal successors, (169), 169 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 169 transitions. [2025-02-07 21:23:02,365 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 169 transitions. Word has length 74 [2025-02-07 21:23:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:02,365 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 169 transitions. [2025-02-07 21:23:02,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 24 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 169 transitions. [2025-02-07 21:23:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:02,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:02,367 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:02,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:23:02,368 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:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1891586770, now seen corresponding path program 1 times [2025-02-07 21:23:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:02,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635455153] [2025-02-07 21:23:02,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:02,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:02,873 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,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:02,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635455153] [2025-02-07 21:23:02,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635455153] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:02,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:02,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:23:02,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910520504] [2025-02-07 21:23:02,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:02,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:23:02,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:02,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:23:02,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:23:02,875 INFO L87 Difference]: Start difference. First operand 170 states and 169 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:03,262 INFO L93 Difference]: Finished difference Result 170 states and 169 transitions. [2025-02-07 21:23:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:23:03,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:23:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:03,263 INFO L225 Difference]: With dead ends: 170 [2025-02-07 21:23:03,263 INFO L226 Difference]: Without dead ends: 156 [2025-02-07 21:23:03,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:23:03,265 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 360 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:03,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 929 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:03,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-07 21:23:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-07 21:23:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 149 states have (on average 1.0402684563758389) internal successors, (155), 155 states have internal predecessors, (155), 0 states have call successors, (0), 0 states 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,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 155 transitions. [2025-02-07 21:23:03,274 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 155 transitions. Word has length 74 [2025-02-07 21:23:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:03,274 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 155 transitions. [2025-02-07 21:23:03,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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,274 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 155 transitions. [2025-02-07 21:23:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:03,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:03,275 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] [2025-02-07 21:23:03,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:23:03,275 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:03,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1504334232, now seen corresponding path program 1 times [2025-02-07 21:23:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:03,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395224833] [2025-02-07 21:23:03,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:03,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:03,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:03,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:03,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:03,731 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:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395224833] [2025-02-07 21:23:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395224833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:03,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457992833] [2025-02-07 21:23:03,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:03,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:03,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:03,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:03,733 INFO L87 Difference]: Start difference. First operand 156 states and 155 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:04,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:04,026 INFO L93 Difference]: Finished difference Result 156 states and 155 transitions. [2025-02-07 21:23:04,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:04,026 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:23:04,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:04,027 INFO L225 Difference]: With dead ends: 156 [2025-02-07 21:23:04,027 INFO L226 Difference]: Without dead ends: 151 [2025-02-07 21:23:04,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:04,028 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 496 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:04,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 655 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:04,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-07 21:23:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-02-07 21:23:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 150 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 150 transitions. [2025-02-07 21:23:04,032 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 150 transitions. Word has length 74 [2025-02-07 21:23:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:04,033 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 150 transitions. [2025-02-07 21:23:04,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 11 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 150 transitions. [2025-02-07 21:23:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 21:23:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:04,033 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] [2025-02-07 21:23:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:23:04,034 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:04,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:04,034 INFO L85 PathProgramCache]: Analyzing trace with hash 315401066, now seen corresponding path program 1 times [2025-02-07 21:23:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376802859] [2025-02-07 21:23:04,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:04,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 21:23:04,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 21:23:04,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:04,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:04,434 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:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376802859] [2025-02-07 21:23:04,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376802859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:04,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:04,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 21:23:04,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362816843] [2025-02-07 21:23:04,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:04,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 21:23:04,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:04,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 21:23:04,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:23:04,436 INFO L87 Difference]: Start difference. First operand 151 states and 150 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:04,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:04,646 INFO L93 Difference]: Finished difference Result 151 states and 150 transitions. [2025-02-07 21:23:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 21:23:04,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-02-07 21:23:04,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:04,647 INFO L225 Difference]: With dead ends: 151 [2025-02-07 21:23:04,647 INFO L226 Difference]: Without dead ends: 113 [2025-02-07 21:23:04,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:23:04,648 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 338 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:04,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 307 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-07 21:23:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-07 21:23:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 110 states have (on average 1.018181818181818) internal successors, (112), 112 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 112 transitions. [2025-02-07 21:23:04,656 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 112 transitions. Word has length 74 [2025-02-07 21:23:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:04,657 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 112 transitions. [2025-02-07 21:23:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 112 transitions. [2025-02-07 21:23:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:04,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:04,657 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:04,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:23:04,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1272954114, now seen corresponding path program 1 times [2025-02-07 21:23:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024350251] [2025-02-07 21:23:04,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:04,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:04,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:04,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:04,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:04,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:23:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024350251] [2025-02-07 21:23:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024350251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:05,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455613217] [2025-02-07 21:23:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:05,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:05,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:05,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:05,023 INFO L87 Difference]: Start difference. First operand 113 states and 112 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:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:05,283 INFO L93 Difference]: Finished difference Result 113 states and 112 transitions. [2025-02-07 21:23:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:05,284 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:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:05,284 INFO L225 Difference]: With dead ends: 113 [2025-02-07 21:23:05,284 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 21:23:05,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:05,285 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 275 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:05,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 433 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 21:23:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-07 21:23:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0096153846153846) internal successors, (105), 105 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 105 transitions. [2025-02-07 21:23:05,288 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 105 transitions. Word has length 75 [2025-02-07 21:23:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 105 transitions. [2025-02-07 21:23:05,289 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:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 105 transitions. [2025-02-07 21:23:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:23:05,289 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:05,289 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:05,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:23:05,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:05,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1716951556, now seen corresponding path program 1 times [2025-02-07 21:23:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772007640] [2025-02-07 21:23:05,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:05,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:23:05,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:23:05,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:06,596 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:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772007640] [2025-02-07 21:23:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772007640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:23:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192931354] [2025-02-07 21:23:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:23:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:23:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:23:06,598 INFO L87 Difference]: Start difference. First operand 106 states and 105 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 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,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:07,883 INFO L93 Difference]: Finished difference Result 106 states and 105 transitions. [2025-02-07 21:23:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 21:23:07,884 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 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,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:07,885 INFO L225 Difference]: With dead ends: 106 [2025-02-07 21:23:07,885 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 21:23:07,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=395, Invalid=2055, Unknown=0, NotChecked=0, Total=2450 [2025-02-07 21:23:07,888 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 400 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:07,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 808 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:23:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 21:23:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-07 21:23:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0) internal successors, (95), 95 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 95 transitions. [2025-02-07 21:23:07,895 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 95 transitions. Word has length 75 [2025-02-07 21:23:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:07,895 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 95 transitions. [2025-02-07 21:23:07,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 27 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,895 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 95 transitions. [2025-02-07 21:23:07,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-07 21:23:07,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:07,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:07,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:23:07,896 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:07,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1227511149, now seen corresponding path program 1 times [2025-02-07 21:23:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772380460] [2025-02-07 21:23:07,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-07 21:23:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 21:23:07,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:07,953 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:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772380460] [2025-02-07 21:23:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772380460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:07,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:23:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077101167] [2025-02-07 21:23:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:23:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:07,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:23:07,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:23:07,955 INFO L87 Difference]: Start difference. First operand 96 states and 95 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:07,965 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2025-02-07 21:23:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:23:07,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-07 21:23:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:07,966 INFO L225 Difference]: With dead ends: 96 [2025-02-07 21:23:07,966 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:23:07,966 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:07,967 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:07,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 86 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:23:07,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:23:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:23:07,967 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:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:23:07,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2025-02-07 21:23:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:07,968 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:23:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:23:07,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:23:07,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 21:23:07,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 21:23:07,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 21:23:07,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 21:23:07,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 21:23:07,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 21:23:07,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:23:07,974 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:07,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:23:07,979 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:23:07,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:23:07 BoogieIcfgContainer [2025-02-07 21:23:07,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:23:07,985 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:23:07,985 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:23:07,985 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:23:07,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:55" (3/4) ... [2025-02-07 21:23:07,987 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:23:08,023 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:23:08,026 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:23:08,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:23:08,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:23:08,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:23:08,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:23:08,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:23:08,197 INFO L158 Benchmark]: Toolchain (without parser) took 16060.46ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 120.6MB in the beginning and 177.6MB in the end (delta: -57.0MB). Peak memory consumption was 214.0MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,197 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:23:08,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 779.37ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 60.2MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.31ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 46.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,197 INFO L158 Benchmark]: Boogie Preprocessor took 152.62ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 35.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,197 INFO L158 Benchmark]: IcfgBuilder took 2064.79ms. Allocated memory is still 167.8MB. Free memory was 35.1MB in the beginning and 98.7MB in the end (delta: -63.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,200 INFO L158 Benchmark]: TraceAbstraction took 12764.60ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 97.4MB in the beginning and 211.1MB in the end (delta: -113.7MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,200 INFO L158 Benchmark]: Witness Printer took 210.89ms. Allocated memory is still 436.2MB. Free memory was 211.1MB in the beginning and 177.6MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:23:08,202 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.17ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 779.37ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 60.2MB in the end (delta: 59.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.31ms. Allocated memory is still 167.8MB. Free memory was 60.2MB in the beginning and 46.4MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.62ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 35.1MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2064.79ms. Allocated memory is still 167.8MB. Free memory was 35.1MB in the beginning and 98.7MB in the end (delta: -63.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12764.60ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 97.4MB in the beginning and 211.1MB in the end (delta: -113.7MB). Peak memory consumption was 154.4MB. Max. memory is 16.1GB. * Witness Printer took 210.89ms. Allocated memory is still 436.2MB. Free memory was 211.1MB in the beginning and 177.6MB in the end (delta: 33.5MB). 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: 598]: 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: 934]: 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: 1026]: 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: 1077]: 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: 1196]: 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: 1247]: 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: 1325]: 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: 1508]: 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: 1559]: 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: 1637]: 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: 1779]: 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: 2077]: 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: 2128]: 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: 2206]: 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: 2348]: 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: 2595]: 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: 12.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7497 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7497 mSDsluCounter, 9618 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7945 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3215 IncrementalHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1673 mSDtfsCounter, 3215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=0, InterpolantAutomatonStates: 131, 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.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 14809 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:08,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE