./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-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 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:48:49,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:48:49,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:48:49,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:48:49,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:48:49,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:48:49,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:48:49,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:48:49,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:48:49,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:48:49,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:48:49,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:48:49,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:48:49,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:48:49,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:48:49,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:48:49,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:48:49,090 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 -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 [2025-02-05 14:48:49,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:48:49,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:48:49,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:48:49,336 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:48:49,336 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:48:49,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-02-05 14:48:50,575 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab5e2b7d/5d1a6f5639b44b41b944d203a04bf798/FLAGcaf67f40a [2025-02-05 14:48:50,968 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:48:50,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-02-05 14:48:50,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab5e2b7d/5d1a6f5639b44b41b944d203a04bf798/FLAGcaf67f40a [2025-02-05 14:48:51,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ab5e2b7d/5d1a6f5639b44b41b944d203a04bf798 [2025-02-05 14:48:51,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:48:51,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:48:51,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:48:51,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:48:51,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:48:51,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:48:51" (1/1) ... [2025-02-05 14:48:51,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1855529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:51, skipping insertion in model container [2025-02-05 14:48:51,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:48:51" (1/1) ... [2025-02-05 14:48:51,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:48:51,390 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-02-05 14:48:51,411 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-02-05 14:48:51,830 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-02-05 14:48:51,835 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-02-05 14:48:51,838 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-02-05 14:48:51,841 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-02-05 14:48:51,848 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-02-05 14:48:51,853 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-02-05 14:48:51,857 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-02-05 14:48:51,862 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-02-05 14:48:51,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-02-05 14:48:51,880 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-02-05 14:48:51,882 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-02-05 14:48:51,884 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-02-05 14:48:51,886 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-02-05 14:48:51,888 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-02-05 14:48:51,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:48:51,911 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:48:51,921 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-02-05 14:48:51,921 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-02-05 14:48:52,129 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-02-05 14:48:52,131 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-02-05 14:48:52,138 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-02-05 14:48:52,140 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-02-05 14:48:52,145 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-02-05 14:48:52,146 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-02-05 14:48:52,151 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-02-05 14:48:52,152 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-02-05 14:48:52,157 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-02-05 14:48:52,158 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-02-05 14:48:52,159 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-02-05 14:48:52,160 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-02-05 14:48:52,162 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-02-05 14:48:52,163 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/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-02-05 14:48:52,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:48:52,187 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:48:52,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52 WrapperNode [2025-02-05 14:48:52,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:48:52,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:48:52,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:48:52,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:48:52,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,226 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,378 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3587 [2025-02-05 14:48:52,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:48:52,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:48:52,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:48:52,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:48:52,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,430 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 14:48:52,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,459 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:48:52,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:48:52,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:48:52,494 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:48:52,494 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (1/1) ... [2025-02-05 14:48:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:48:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:48:52,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:48:52,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:48:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:48:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:48:52,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:48:52,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:48:52,732 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:48:52,733 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3471: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~main____CPAchecker_TMP_1~41#1;havoc main_~__tmp_200~0#1, main_~__VERIFIER_assert__cond~199#1;havoc main_~__tmp_199~0#1, main_~__VERIFIER_assert__cond~198#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1159: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~main____CPAchecker_TMP_1~7#1;havoc main_~__tmp_64~0#1, main_~__VERIFIER_assert__cond~63#1;havoc main_~__tmp_63~0#1, main_~__VERIFIER_assert__cond~62#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2613: havoc main_~main____CPAchecker_TMP_2~29#1;havoc main_~__tmp_150~0#1, main_~__VERIFIER_assert__cond~149#1;havoc main_~__tmp_149~0#1, main_~__VERIFIER_assert__cond~148#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L500: havoc main_~main____CPAchecker_TMP_7~2#1;havoc main_~__tmp_28~0#1, main_~__VERIFIER_assert__cond~27#1;havoc main_~__tmp_27~0#1, main_~__VERIFIER_assert__cond~26#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~main____CPAchecker_TMP_1~42#1;havoc main_~__tmp_204~0#1, main_~__VERIFIER_assert__cond~203#1;havoc main_~__tmp_203~0#1, main_~__VERIFIER_assert__cond~202#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1227: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~main____CPAchecker_TMP_1~8#1;havoc main_~__tmp_68~0#1, main_~__VERIFIER_assert__cond~67#1;havoc main_~__tmp_67~0#1, main_~__VERIFIER_assert__cond~66#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2681: havoc main_~main____CPAchecker_TMP_2~30#1;havoc main_~__tmp_154~0#1, main_~__VERIFIER_assert__cond~153#1;havoc main_~__tmp_153~0#1, main_~__VERIFIER_assert__cond~152#1; [2025-02-05 14:48:54,228 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1;havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4730: havoc main_~main____CPAchecker_TMP_2~60#1;havoc main_~__tmp_274~0#1, main_~__VERIFIER_assert__cond~273#1;havoc main_~__tmp_273~0#1, main_~__VERIFIER_assert__cond~272#1;havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~main____CPAchecker_TMP_1~59#1;havoc main_~__tmp_272~0#1, main_~__VERIFIER_assert__cond~271#1;havoc main_~__tmp_271~0#1, main_~__VERIFIER_assert__cond~270#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3607: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~main____CPAchecker_TMP_1~43#1;havoc main_~__tmp_208~0#1, main_~__VERIFIER_assert__cond~207#1;havoc main_~__tmp_207~0#1, main_~__VERIFIER_assert__cond~206#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~main____CPAchecker_TMP_1~9#1;havoc main_~__tmp_72~0#1, main_~__VERIFIER_assert__cond~71#1;havoc main_~__tmp_71~0#1, main_~__VERIFIER_assert__cond~70#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2749: havoc main_~main____CPAchecker_TMP_2~31#1;havoc main_~__tmp_158~0#1, main_~__VERIFIER_assert__cond~157#1;havoc main_~__tmp_157~0#1, main_~__VERIFIER_assert__cond~156#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3675: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~main____CPAchecker_TMP_1~44#1;havoc main_~__tmp_212~0#1, main_~__VERIFIER_assert__cond~211#1;havoc main_~__tmp_211~0#1, main_~__VERIFIER_assert__cond~210#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1363: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~main____CPAchecker_TMP_1~10#1;havoc main_~__tmp_76~0#1, main_~__VERIFIER_assert__cond~75#1;havoc main_~__tmp_75~0#1, main_~__VERIFIER_assert__cond~74#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2817: havoc main_~main____CPAchecker_TMP_2~32#1;havoc main_~__tmp_162~0#1, main_~__VERIFIER_assert__cond~161#1;havoc main_~__tmp_161~0#1, main_~__VERIFIER_assert__cond~160#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L307: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1;havoc main_~main____CPAchecker_TMP_5~1#1;havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3743: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~main____CPAchecker_TMP_1~45#1;havoc main_~__tmp_216~0#1, main_~__VERIFIER_assert__cond~215#1;havoc main_~__tmp_215~0#1, main_~__VERIFIER_assert__cond~214#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~main____CPAchecker_TMP_1~11#1;havoc main_~__tmp_80~0#1, main_~__VERIFIER_assert__cond~79#1;havoc main_~__tmp_79~0#1, main_~__VERIFIER_assert__cond~78#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: havoc main_~main____CPAchecker_TMP_2~33#1;havoc main_~__tmp_166~0#1, main_~__VERIFIER_assert__cond~165#1;havoc main_~__tmp_165~0#1, main_~__VERIFIER_assert__cond~164#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L243: havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3811: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~main____CPAchecker_TMP_1~46#1;havoc main_~__tmp_220~0#1, main_~__VERIFIER_assert__cond~219#1;havoc main_~__tmp_219~0#1, main_~__VERIFIER_assert__cond~218#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~main____CPAchecker_TMP_1~12#1;havoc main_~__tmp_84~0#1, main_~__VERIFIER_assert__cond~83#1;havoc main_~__tmp_83~0#1, main_~__VERIFIER_assert__cond~82#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2953: havoc main_~main____CPAchecker_TMP_2~34#1;havoc main_~__tmp_170~0#1, main_~__VERIFIER_assert__cond~169#1;havoc main_~__tmp_169~0#1, main_~__VERIFIER_assert__cond~168#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4870: havoc main_~main____CPAchecker_TMP_7~3#1;havoc main_~__tmp_282~0#1, main_~__VERIFIER_assert__cond~281#1;havoc main_~__tmp_281~0#1, main_~__VERIFIER_assert__cond~280#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3879: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~main____CPAchecker_TMP_1~47#1;havoc main_~__tmp_224~0#1, main_~__VERIFIER_assert__cond~223#1;havoc main_~__tmp_223~0#1, main_~__VERIFIER_assert__cond~222#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~main____CPAchecker_TMP_1~13#1;havoc main_~__tmp_88~0#1, main_~__VERIFIER_assert__cond~87#1;havoc main_~__tmp_87~0#1, main_~__VERIFIER_assert__cond~86#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3021: havoc main_~main____CPAchecker_TMP_2~35#1;havoc main_~__tmp_174~0#1, main_~__VERIFIER_assert__cond~173#1;havoc main_~__tmp_173~0#1, main_~__VERIFIER_assert__cond~172#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~__tmp_38~0#1, main_~__VERIFIER_assert__cond~37#1;havoc main_~__tmp_37~0#1, main_~__VERIFIER_assert__cond~36#1; [2025-02-05 14:48:54,229 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L577: havoc main_~__tmp_32~0#1, main_~__VERIFIER_assert__cond~31#1;havoc main_~__tmp_31~0#1, main_~__VERIFIER_assert__cond~30#1;havoc main_~main____CPAchecker_TMP_6~1#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3947: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~main____CPAchecker_TMP_1~48#1;havoc main_~__tmp_228~0#1, main_~__VERIFIER_assert__cond~227#1;havoc main_~__tmp_227~0#1, main_~__VERIFIER_assert__cond~226#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1635: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~main____CPAchecker_TMP_1~14#1;havoc main_~__tmp_92~0#1, main_~__VERIFIER_assert__cond~91#1;havoc main_~__tmp_91~0#1, main_~__VERIFIER_assert__cond~90#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3089: havoc main_~main____CPAchecker_TMP_2~36#1;havoc main_~__tmp_178~0#1, main_~__VERIFIER_assert__cond~177#1;havoc main_~__tmp_177~0#1, main_~__VERIFIER_assert__cond~176#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc main_~main____CPAchecker_TMP_2~2#1;havoc main_~__tmp_42~0#1, main_~__VERIFIER_assert__cond~41#1;havoc main_~__tmp_41~0#1, main_~__VERIFIER_assert__cond~40#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L447: havoc main_~__tmp_26~0#1, main_~__VERIFIER_assert__cond~25#1;havoc main_~__tmp_25~0#1, main_~__VERIFIER_assert__cond~24#1;havoc main_~main____CPAchecker_TMP_5~2#1;havoc main_~__tmp_24~0#1, main_~__VERIFIER_assert__cond~23#1;havoc main_~__tmp_23~0#1, main_~__VERIFIER_assert__cond~22#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4015: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~main____CPAchecker_TMP_1~49#1;havoc main_~__tmp_232~0#1, main_~__VERIFIER_assert__cond~231#1;havoc main_~__tmp_231~0#1, main_~__VERIFIER_assert__cond~230#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1703: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~main____CPAchecker_TMP_1~15#1;havoc main_~__tmp_96~0#1, main_~__VERIFIER_assert__cond~95#1;havoc main_~__tmp_95~0#1, main_~__VERIFIER_assert__cond~94#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3157: havoc main_~main____CPAchecker_TMP_2~37#1;havoc main_~__tmp_182~0#1, main_~__VERIFIER_assert__cond~181#1;havoc main_~__tmp_181~0#1, main_~__VERIFIER_assert__cond~180#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L845: havoc main_~main____CPAchecker_TMP_2~3#1;havoc main_~__tmp_46~0#1, main_~__VERIFIER_assert__cond~45#1;havoc main_~__tmp_45~0#1, main_~__VERIFIER_assert__cond~44#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_22~0#1, main_~__VERIFIER_assert__cond~21#1;havoc main_~__tmp_21~0#1, main_~__VERIFIER_assert__cond~20#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4083: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~main____CPAchecker_TMP_1~50#1;havoc main_~__tmp_236~0#1, main_~__VERIFIER_assert__cond~235#1;havoc main_~__tmp_235~0#1, main_~__VERIFIER_assert__cond~234#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1771: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~main____CPAchecker_TMP_1~16#1;havoc main_~__tmp_100~0#1, main_~__VERIFIER_assert__cond~99#1;havoc main_~__tmp_99~0#1, main_~__VERIFIER_assert__cond~98#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc main_~main____CPAchecker_TMP_2~38#1;havoc main_~__tmp_186~0#1, main_~__VERIFIER_assert__cond~185#1;havoc main_~__tmp_185~0#1, main_~__VERIFIER_assert__cond~184#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L913: havoc main_~main____CPAchecker_TMP_2~4#1;havoc main_~__tmp_50~0#1, main_~__VERIFIER_assert__cond~49#1;havoc main_~__tmp_49~0#1, main_~__VERIFIER_assert__cond~48#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4151: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~main____CPAchecker_TMP_1~51#1;havoc main_~__tmp_240~0#1, main_~__VERIFIER_assert__cond~239#1;havoc main_~__tmp_239~0#1, main_~__VERIFIER_assert__cond~238#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~main____CPAchecker_TMP_1~17#1;havoc main_~__tmp_104~0#1, main_~__VERIFIER_assert__cond~103#1;havoc main_~__tmp_103~0#1, main_~__VERIFIER_assert__cond~102#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3293: havoc main_~main____CPAchecker_TMP_2~39#1;havoc main_~__tmp_190~0#1, main_~__VERIFIER_assert__cond~189#1;havoc main_~__tmp_189~0#1, main_~__VERIFIER_assert__cond~188#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L981: havoc main_~main____CPAchecker_TMP_2~5#1;havoc main_~__tmp_54~0#1, main_~__VERIFIER_assert__cond~53#1;havoc main_~__tmp_53~0#1, main_~__VERIFIER_assert__cond~52#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4219: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~main____CPAchecker_TMP_1~52#1;havoc main_~__tmp_244~0#1, main_~__VERIFIER_assert__cond~243#1;havoc main_~__tmp_243~0#1, main_~__VERIFIER_assert__cond~242#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~main____CPAchecker_TMP_1~18#1;havoc main_~__tmp_108~0#1, main_~__VERIFIER_assert__cond~107#1;havoc main_~__tmp_107~0#1, main_~__VERIFIER_assert__cond~106#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4748: havoc main_~__tmp_276~0#1, main_~__VERIFIER_assert__cond~275#1;havoc main_~__tmp_275~0#1, main_~__VERIFIER_assert__cond~274#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3361: havoc main_~main____CPAchecker_TMP_2~40#1;havoc main_~__tmp_194~0#1, main_~__VERIFIER_assert__cond~193#1;havoc main_~__tmp_193~0#1, main_~__VERIFIER_assert__cond~192#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1049: havoc main_~main____CPAchecker_TMP_2~6#1;havoc main_~__tmp_58~0#1, main_~__VERIFIER_assert__cond~57#1;havoc main_~__tmp_57~0#1, main_~__VERIFIER_assert__cond~56#1; [2025-02-05 14:48:54,230 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4287: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~main____CPAchecker_TMP_1~53#1;havoc main_~__tmp_248~0#1, main_~__VERIFIER_assert__cond~247#1;havoc main_~__tmp_247~0#1, main_~__VERIFIER_assert__cond~246#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1975: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~main____CPAchecker_TMP_1~19#1;havoc main_~__tmp_112~0#1, main_~__VERIFIER_assert__cond~111#1;havoc main_~__tmp_111~0#1, main_~__VERIFIER_assert__cond~110#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4816: havoc main_~__tmp_280~0#1, main_~__VERIFIER_assert__cond~279#1;havoc main_~__tmp_279~0#1, main_~__VERIFIER_assert__cond~278#1;havoc main_~main____CPAchecker_TMP_5~3#1;havoc main_~__tmp_278~0#1, main_~__VERIFIER_assert__cond~277#1;havoc main_~__tmp_277~0#1, main_~__VERIFIER_assert__cond~276#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3429: havoc main_~main____CPAchecker_TMP_2~41#1;havoc main_~__tmp_198~0#1, main_~__VERIFIER_assert__cond~197#1;havoc main_~__tmp_197~0#1, main_~__VERIFIER_assert__cond~196#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: havoc main_~main____CPAchecker_TMP_2~7#1;havoc main_~__tmp_62~0#1, main_~__VERIFIER_assert__cond~61#1;havoc main_~__tmp_61~0#1, main_~__VERIFIER_assert__cond~60#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4355: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~main____CPAchecker_TMP_1~54#1;havoc main_~__tmp_252~0#1, main_~__VERIFIER_assert__cond~251#1;havoc main_~__tmp_251~0#1, main_~__VERIFIER_assert__cond~250#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2043: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~main____CPAchecker_TMP_1~20#1;havoc main_~__tmp_116~0#1, main_~__VERIFIER_assert__cond~115#1;havoc main_~__tmp_115~0#1, main_~__VERIFIER_assert__cond~114#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3497: havoc main_~main____CPAchecker_TMP_2~42#1;havoc main_~__tmp_202~0#1, main_~__VERIFIER_assert__cond~201#1;havoc main_~__tmp_201~0#1, main_~__VERIFIER_assert__cond~200#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185: havoc main_~main____CPAchecker_TMP_2~8#1;havoc main_~__tmp_66~0#1, main_~__VERIFIER_assert__cond~65#1;havoc main_~__tmp_65~0#1, main_~__VERIFIER_assert__cond~64#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4423: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~main____CPAchecker_TMP_1~55#1;havoc main_~__tmp_256~0#1, main_~__VERIFIER_assert__cond~255#1;havoc main_~__tmp_255~0#1, main_~__VERIFIER_assert__cond~254#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~main____CPAchecker_TMP_3~1#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_4~0#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2111: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~main____CPAchecker_TMP_1~21#1;havoc main_~__tmp_120~0#1, main_~__VERIFIER_assert__cond~119#1;havoc main_~__tmp_119~0#1, main_~__VERIFIER_assert__cond~118#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: havoc main_~main____CPAchecker_TMP_2~43#1;havoc main_~__tmp_206~0#1, main_~__VERIFIER_assert__cond~205#1;havoc main_~__tmp_205~0#1, main_~__VERIFIER_assert__cond~204#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~main____CPAchecker_TMP_2~9#1;havoc main_~__tmp_70~0#1, main_~__VERIFIER_assert__cond~69#1;havoc main_~__tmp_69~0#1, main_~__VERIFIER_assert__cond~68#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4491: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~main____CPAchecker_TMP_1~56#1;havoc main_~__tmp_260~0#1, main_~__VERIFIER_assert__cond~259#1;havoc main_~__tmp_259~0#1, main_~__VERIFIER_assert__cond~258#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2179: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~main____CPAchecker_TMP_1~22#1;havoc main_~__tmp_124~0#1, main_~__VERIFIER_assert__cond~123#1;havoc main_~__tmp_123~0#1, main_~__VERIFIER_assert__cond~122#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3633: havoc main_~main____CPAchecker_TMP_2~44#1;havoc main_~__tmp_210~0#1, main_~__VERIFIER_assert__cond~209#1;havoc main_~__tmp_209~0#1, main_~__VERIFIER_assert__cond~208#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1321: havoc main_~main____CPAchecker_TMP_2~10#1;havoc main_~__tmp_74~0#1, main_~__VERIFIER_assert__cond~73#1;havoc main_~__tmp_73~0#1, main_~__VERIFIER_assert__cond~72#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4559: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~main____CPAchecker_TMP_1~57#1;havoc main_~__tmp_264~0#1, main_~__VERIFIER_assert__cond~263#1;havoc main_~__tmp_263~0#1, main_~__VERIFIER_assert__cond~262#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~main____CPAchecker_TMP_4~1#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2247: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~main____CPAchecker_TMP_1~23#1;havoc main_~__tmp_128~0#1, main_~__VERIFIER_assert__cond~127#1;havoc main_~__tmp_127~0#1, main_~__VERIFIER_assert__cond~126#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3701: havoc main_~main____CPAchecker_TMP_2~45#1;havoc main_~__tmp_214~0#1, main_~__VERIFIER_assert__cond~213#1;havoc main_~__tmp_213~0#1, main_~__VERIFIER_assert__cond~212#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L530: havoc main_~__tmp_30~0#1, main_~__VERIFIER_assert__cond~29#1;havoc main_~__tmp_29~0#1, main_~__VERIFIER_assert__cond~28#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-02-05 14:48:54,231 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1389: havoc main_~main____CPAchecker_TMP_2~11#1;havoc main_~__tmp_78~0#1, main_~__VERIFIER_assert__cond~77#1;havoc main_~__tmp_77~0#1, main_~__VERIFIER_assert__cond~76#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4627: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~main____CPAchecker_TMP_1~58#1;havoc main_~__tmp_268~0#1, main_~__VERIFIER_assert__cond~267#1;havoc main_~__tmp_267~0#1, main_~__VERIFIER_assert__cond~266#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2315: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~main____CPAchecker_TMP_1~24#1;havoc main_~__tmp_132~0#1, main_~__VERIFIER_assert__cond~131#1;havoc main_~__tmp_131~0#1, main_~__VERIFIER_assert__cond~130#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3769: havoc main_~main____CPAchecker_TMP_2~46#1;havoc main_~__tmp_218~0#1, main_~__VERIFIER_assert__cond~217#1;havoc main_~__tmp_217~0#1, main_~__VERIFIER_assert__cond~216#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1457: havoc main_~main____CPAchecker_TMP_2~12#1;havoc main_~__tmp_82~0#1, main_~__VERIFIER_assert__cond~81#1;havoc main_~__tmp_81~0#1, main_~__VERIFIER_assert__cond~80#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~main____CPAchecker_TMP_3~2#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2383: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~main____CPAchecker_TMP_1~25#1;havoc main_~__tmp_136~0#1, main_~__VERIFIER_assert__cond~135#1;havoc main_~__tmp_135~0#1, main_~__VERIFIER_assert__cond~134#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3837: havoc main_~main____CPAchecker_TMP_2~47#1;havoc main_~__tmp_222~0#1, main_~__VERIFIER_assert__cond~221#1;havoc main_~__tmp_221~0#1, main_~__VERIFIER_assert__cond~220#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: havoc main_~main____CPAchecker_TMP_2~13#1;havoc main_~__tmp_86~0#1, main_~__VERIFIER_assert__cond~85#1;havoc main_~__tmp_85~0#1, main_~__VERIFIER_assert__cond~84#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~main____CPAchecker_TMP_1~26#1;havoc main_~__tmp_140~0#1, main_~__VERIFIER_assert__cond~139#1;havoc main_~__tmp_139~0#1, main_~__VERIFIER_assert__cond~138#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3905: havoc main_~main____CPAchecker_TMP_2~48#1;havoc main_~__tmp_226~0#1, main_~__VERIFIER_assert__cond~225#1;havoc main_~__tmp_225~0#1, main_~__VERIFIER_assert__cond~224#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~main____CPAchecker_TMP_2~14#1;havoc main_~__tmp_90~0#1, main_~__VERIFIER_assert__cond~89#1;havoc main_~__tmp_89~0#1, main_~__VERIFIER_assert__cond~88#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~main____CPAchecker_TMP_1~27#1;havoc main_~__tmp_144~0#1, main_~__VERIFIER_assert__cond~143#1;havoc main_~__tmp_143~0#1, main_~__VERIFIER_assert__cond~142#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L405: havoc main_~main____CPAchecker_TMP_4~2#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3973: havoc main_~main____CPAchecker_TMP_2~49#1;havoc main_~__tmp_230~0#1, main_~__VERIFIER_assert__cond~229#1;havoc main_~__tmp_229~0#1, main_~__VERIFIER_assert__cond~228#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4898: havoc main_~__tmp_284~0#1, main_~__VERIFIER_assert__cond~283#1;havoc main_~__tmp_283~0#1, main_~__VERIFIER_assert__cond~282#1;havoc main_~main____CPAchecker_TMP_6~3#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1661: havoc main_~main____CPAchecker_TMP_2~15#1;havoc main_~__tmp_94~0#1, main_~__VERIFIER_assert__cond~93#1;havoc main_~__tmp_93~0#1, main_~__VERIFIER_assert__cond~92#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4767: havoc main_~main____CPAchecker_TMP_3~3#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~main____CPAchecker_TMP_1~28#1;havoc main_~__tmp_148~0#1, main_~__VERIFIER_assert__cond~147#1;havoc main_~__tmp_147~0#1, main_~__VERIFIER_assert__cond~146#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4041: havoc main_~main____CPAchecker_TMP_2~50#1;havoc main_~__tmp_234~0#1, main_~__VERIFIER_assert__cond~233#1;havoc main_~__tmp_233~0#1, main_~__VERIFIER_assert__cond~232#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1729: havoc main_~main____CPAchecker_TMP_2~16#1;havoc main_~__tmp_98~0#1, main_~__VERIFIER_assert__cond~97#1;havoc main_~__tmp_97~0#1, main_~__VERIFIER_assert__cond~96#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2655: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~main____CPAchecker_TMP_1~29#1;havoc main_~__tmp_152~0#1, main_~__VERIFIER_assert__cond~151#1;havoc main_~__tmp_151~0#1, main_~__VERIFIER_assert__cond~150#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~main____CPAchecker_TMP_2~51#1;havoc main_~__tmp_238~0#1, main_~__VERIFIER_assert__cond~237#1;havoc main_~__tmp_237~0#1, main_~__VERIFIER_assert__cond~236#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: havoc main_~main____CPAchecker_TMP_2~17#1;havoc main_~__tmp_102~0#1, main_~__VERIFIER_assert__cond~101#1;havoc main_~__tmp_101~0#1, main_~__VERIFIER_assert__cond~100#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~main____CPAchecker_TMP_4~3#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2723: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~main____CPAchecker_TMP_1~30#1;havoc main_~__tmp_156~0#1, main_~__VERIFIER_assert__cond~155#1;havoc main_~__tmp_155~0#1, main_~__VERIFIER_assert__cond~154#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4177: havoc main_~main____CPAchecker_TMP_2~52#1;havoc main_~__tmp_242~0#1, main_~__VERIFIER_assert__cond~241#1;havoc main_~__tmp_241~0#1, main_~__VERIFIER_assert__cond~240#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1865: havoc main_~main____CPAchecker_TMP_2~18#1;havoc main_~__tmp_106~0#1, main_~__VERIFIER_assert__cond~105#1;havoc main_~__tmp_105~0#1, main_~__VERIFIER_assert__cond~104#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~main____CPAchecker_TMP_1~31#1;havoc main_~__tmp_160~0#1, main_~__VERIFIER_assert__cond~159#1;havoc main_~__tmp_159~0#1, main_~__VERIFIER_assert__cond~158#1; [2025-02-05 14:48:54,232 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4245: havoc main_~main____CPAchecker_TMP_2~53#1;havoc main_~__tmp_246~0#1, main_~__VERIFIER_assert__cond~245#1;havoc main_~__tmp_245~0#1, main_~__VERIFIER_assert__cond~244#1; [2025-02-05 14:48:54,234 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1933: havoc main_~main____CPAchecker_TMP_2~19#1;havoc main_~__tmp_110~0#1, main_~__VERIFIER_assert__cond~109#1;havoc main_~__tmp_109~0#1, main_~__VERIFIER_assert__cond~108#1; [2025-02-05 14:48:54,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~main____CPAchecker_TMP_1~32#1;havoc main_~__tmp_164~0#1, main_~__VERIFIER_assert__cond~163#1;havoc main_~__tmp_163~0#1, main_~__VERIFIER_assert__cond~162#1; [2025-02-05 14:48:54,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4313: havoc main_~main____CPAchecker_TMP_2~54#1;havoc main_~__tmp_250~0#1, main_~__VERIFIER_assert__cond~249#1;havoc main_~__tmp_249~0#1, main_~__VERIFIER_assert__cond~248#1; [2025-02-05 14:48:54,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2001: havoc main_~main____CPAchecker_TMP_2~20#1;havoc main_~__tmp_114~0#1, main_~__VERIFIER_assert__cond~113#1;havoc main_~__tmp_113~0#1, main_~__VERIFIER_assert__cond~112#1; [2025-02-05 14:48:54,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2927: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~main____CPAchecker_TMP_1~33#1;havoc main_~__tmp_168~0#1, main_~__VERIFIER_assert__cond~167#1;havoc main_~__tmp_167~0#1, main_~__VERIFIER_assert__cond~166#1; [2025-02-05 14:48:54,235 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc main_~main____CPAchecker_TMP_2~55#1;havoc main_~__tmp_254~0#1, main_~__VERIFIER_assert__cond~253#1;havoc main_~__tmp_253~0#1, main_~__VERIFIER_assert__cond~252#1; [2025-02-05 14:48:54,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~main____CPAchecker_TMP_2~21#1;havoc main_~__tmp_118~0#1, main_~__VERIFIER_assert__cond~117#1;havoc main_~__tmp_117~0#1, main_~__VERIFIER_assert__cond~116#1; [2025-02-05 14:48:54,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2995: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~main____CPAchecker_TMP_1~34#1;havoc main_~__tmp_172~0#1, main_~__VERIFIER_assert__cond~171#1;havoc main_~__tmp_171~0#1, main_~__VERIFIER_assert__cond~170#1; [2025-02-05 14:48:54,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L683: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_36~0#1, main_~__VERIFIER_assert__cond~35#1;havoc main_~__tmp_35~0#1, main_~__VERIFIER_assert__cond~34#1; [2025-02-05 14:48:54,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4449: havoc main_~main____CPAchecker_TMP_2~56#1;havoc main_~__tmp_258~0#1, main_~__VERIFIER_assert__cond~257#1;havoc main_~__tmp_257~0#1, main_~__VERIFIER_assert__cond~256#1; [2025-02-05 14:48:54,236 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2137: havoc main_~main____CPAchecker_TMP_2~22#1;havoc main_~__tmp_122~0#1, main_~__VERIFIER_assert__cond~121#1;havoc main_~__tmp_121~0#1, main_~__VERIFIER_assert__cond~120#1; [2025-02-05 14:48:54,237 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1; [2025-02-05 14:48:54,237 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3063: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~main____CPAchecker_TMP_1~35#1;havoc main_~__tmp_176~0#1, main_~__VERIFIER_assert__cond~175#1;havoc main_~__tmp_175~0#1, main_~__VERIFIER_assert__cond~174#1; [2025-02-05 14:48:54,237 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~__tmp_40~0#1, main_~__VERIFIER_assert__cond~39#1;havoc main_~__tmp_39~0#1, main_~__VERIFIER_assert__cond~38#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4517: havoc main_~main____CPAchecker_TMP_2~57#1;havoc main_~__tmp_262~0#1, main_~__VERIFIER_assert__cond~261#1;havoc main_~__tmp_261~0#1, main_~__VERIFIER_assert__cond~260#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2205: havoc main_~main____CPAchecker_TMP_2~23#1;havoc main_~__tmp_126~0#1, main_~__VERIFIER_assert__cond~125#1;havoc main_~__tmp_125~0#1, main_~__VERIFIER_assert__cond~124#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3131: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~main____CPAchecker_TMP_1~36#1;havoc main_~__tmp_180~0#1, main_~__VERIFIER_assert__cond~179#1;havoc main_~__tmp_179~0#1, main_~__VERIFIER_assert__cond~178#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L819: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~main____CPAchecker_TMP_1~2#1;havoc main_~__tmp_44~0#1, main_~__VERIFIER_assert__cond~43#1;havoc main_~__tmp_43~0#1, main_~__VERIFIER_assert__cond~42#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4585: havoc main_~main____CPAchecker_TMP_2~58#1;havoc main_~__tmp_266~0#1, main_~__VERIFIER_assert__cond~265#1;havoc main_~__tmp_265~0#1, main_~__VERIFIER_assert__cond~264#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2273: havoc main_~main____CPAchecker_TMP_2~24#1;havoc main_~__tmp_130~0#1, main_~__VERIFIER_assert__cond~129#1;havoc main_~__tmp_129~0#1, main_~__VERIFIER_assert__cond~128#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3199: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~main____CPAchecker_TMP_1~37#1;havoc main_~__tmp_184~0#1, main_~__VERIFIER_assert__cond~183#1;havoc main_~__tmp_183~0#1, main_~__VERIFIER_assert__cond~182#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L887: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~main____CPAchecker_TMP_1~3#1;havoc main_~__tmp_48~0#1, main_~__VERIFIER_assert__cond~47#1;havoc main_~__tmp_47~0#1, main_~__VERIFIER_assert__cond~46#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4653: havoc main_~main____CPAchecker_TMP_2~59#1;havoc main_~__tmp_270~0#1, main_~__VERIFIER_assert__cond~269#1;havoc main_~__tmp_269~0#1, main_~__VERIFIER_assert__cond~268#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2341: havoc main_~main____CPAchecker_TMP_2~25#1;havoc main_~__tmp_134~0#1, main_~__VERIFIER_assert__cond~133#1;havoc main_~__tmp_133~0#1, main_~__VERIFIER_assert__cond~132#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc main_~__tmp_34~0#1, main_~__VERIFIER_assert__cond~33#1;havoc main_~__tmp_33~0#1, main_~__VERIFIER_assert__cond~32#1;havoc main_~main____CPAchecker_TMP_6~2#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: havoc main_~main____CPAchecker_TMP_7~1#1;havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3267: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~main____CPAchecker_TMP_1~38#1;havoc main_~__tmp_188~0#1, main_~__VERIFIER_assert__cond~187#1;havoc main_~__tmp_187~0#1, main_~__VERIFIER_assert__cond~186#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~main____CPAchecker_TMP_1~4#1;havoc main_~__tmp_52~0#1, main_~__VERIFIER_assert__cond~51#1;havoc main_~__tmp_51~0#1, main_~__VERIFIER_assert__cond~50#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~main____CPAchecker_TMP_2~26#1;havoc main_~__tmp_138~0#1, main_~__VERIFIER_assert__cond~137#1;havoc main_~__tmp_137~0#1, main_~__VERIFIER_assert__cond~136#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3335: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~main____CPAchecker_TMP_1~39#1;havoc main_~__tmp_192~0#1, main_~__VERIFIER_assert__cond~191#1;havoc main_~__tmp_191~0#1, main_~__VERIFIER_assert__cond~190#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~main____CPAchecker_TMP_1~5#1;havoc main_~__tmp_56~0#1, main_~__VERIFIER_assert__cond~55#1;havoc main_~__tmp_55~0#1, main_~__VERIFIER_assert__cond~54#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2477: havoc main_~main____CPAchecker_TMP_2~27#1;havoc main_~__tmp_142~0#1, main_~__VERIFIER_assert__cond~141#1;havoc main_~__tmp_141~0#1, main_~__VERIFIER_assert__cond~140#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3403: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~main____CPAchecker_TMP_1~40#1;havoc main_~__tmp_196~0#1, main_~__VERIFIER_assert__cond~195#1;havoc main_~__tmp_195~0#1, main_~__VERIFIER_assert__cond~194#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1091: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~main____CPAchecker_TMP_1~6#1;havoc main_~__tmp_60~0#1, main_~__VERIFIER_assert__cond~59#1;havoc main_~__tmp_59~0#1, main_~__VERIFIER_assert__cond~58#1; [2025-02-05 14:48:54,238 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2545: havoc main_~main____CPAchecker_TMP_2~28#1;havoc main_~__tmp_146~0#1, main_~__VERIFIER_assert__cond~145#1;havoc main_~__tmp_145~0#1, main_~__VERIFIER_assert__cond~144#1; [2025-02-05 14:48:54,329 INFO L? ?]: Removed 1160 outVars from TransFormulas that were not future-live. [2025-02-05 14:48:54,329 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:48:54,350 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:48:54,351 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:48:54,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:48:54 BoogieIcfgContainer [2025-02-05 14:48:54,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:48:54,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:48:54,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:48:54,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:48:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:48:51" (1/3) ... [2025-02-05 14:48:54,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d5e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:48:54, skipping insertion in model container [2025-02-05 14:48:54,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:48:52" (2/3) ... [2025-02-05 14:48:54,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d5e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:48:54, skipping insertion in model container [2025-02-05 14:48:54,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:48:54" (3/3) ... [2025-02-05 14:48:54,358 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2025-02-05 14:48:54,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:48:54,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+sep-reducer.c that has 1 procedures, 475 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-05 14:48:54,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:48:54,431 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;@2bf689ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:48:54,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-05 14:48:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:48:54,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:54,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:54,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:48:54,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 510911527, now seen corresponding path program 1 times [2025-02-05 14:48:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541106267] [2025-02-05 14:48:54,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:54,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:48:54,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:48:54,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:54,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541106267] [2025-02-05 14:48:54,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541106267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:48:54,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:48:54,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:48:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745929070] [2025-02-05 14:48:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:48:54,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:48:54,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:54,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:48:54,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:48:54,671 INFO L87 Difference]: Start difference. First operand has 475 states, 458 states have (on average 1.9672489082969433) internal successors, (901), 474 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:55,469 INFO L93 Difference]: Finished difference Result 479 states and 904 transitions. [2025-02-05 14:48:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:48:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-05 14:48:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:55,475 INFO L225 Difference]: With dead ends: 479 [2025-02-05 14:48:55,475 INFO L226 Difference]: Without dead ends: 297 [2025-02-05 14:48:55,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:48:55,479 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 703 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:55,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 713 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 14:48:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-05 14:48:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-02-05 14:48:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 282 states have (on average 1.2765957446808511) internal successors, (360), 296 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2025-02-05 14:48:55,507 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 7 [2025-02-05 14:48:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2025-02-05 14:48:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2025-02-05 14:48:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 14:48:55,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:55,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:55,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:48:55,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:48:55,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1341612614, now seen corresponding path program 1 times [2025-02-05 14:48:55,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:55,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135632102] [2025-02-05 14:48:55,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:55,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:55,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 14:48:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 14:48:55,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135632102] [2025-02-05 14:48:55,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135632102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:48:55,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:48:55,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 14:48:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055691719] [2025-02-05 14:48:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:48:55,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 14:48:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:55,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 14:48:55,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:48:55,632 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:48:55,945 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2025-02-05 14:48:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:48:55,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-02-05 14:48:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:48:55,948 INFO L225 Difference]: With dead ends: 297 [2025-02-05 14:48:55,949 INFO L226 Difference]: Without dead ends: 292 [2025-02-05 14:48:55,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:48:55,950 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 14 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:48:55,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 728 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:48:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-02-05 14:48:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-02-05 14:48:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.0611510791366907) internal successors, (295), 291 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2025-02-05 14:48:55,958 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 8 [2025-02-05 14:48:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:48:55,958 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2025-02-05 14:48:55,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:48:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2025-02-05 14:48:55,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-02-05 14:48:55,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:48:55,966 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:48:55,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 14:48:55,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:48:55,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:48:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash 371726233, now seen corresponding path program 1 times [2025-02-05 14:48:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:48:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234374622] [2025-02-05 14:48:55,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:48:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:48:56,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-02-05 14:48:56,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-02-05 14:48:56,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:48:56,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:48:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:48:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:48:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234374622] [2025-02-05 14:48:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234374622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:48:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:48:59,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-02-05 14:48:59,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265817967] [2025-02-05 14:48:59,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:48:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-02-05 14:48:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:48:59,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-02-05 14:48:59,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 14:48:59,526 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:00,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:00,192 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2025-02-05 14:49:00,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-02-05 14:49:00,193 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2025-02-05 14:49:00,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:00,194 INFO L225 Difference]: With dead ends: 292 [2025-02-05 14:49:00,195 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 14:49:00,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 14:49:00,196 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 117 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:00,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 116 Invalid, 1712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 14:49:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 14:49:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-05 14:49:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.0577617328519855) internal successors, (293), 289 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2025-02-05 14:49:00,206 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 244 [2025-02-05 14:49:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:00,208 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2025-02-05 14:49:00,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2025-02-05 14:49:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-02-05 14:49:00,211 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:00,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:00,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:49:00,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:00,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1361384295, now seen corresponding path program 1 times [2025-02-05 14:49:00,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142129755] [2025-02-05 14:49:00,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:00,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-02-05 14:49:00,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-02-05 14:49:00,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:00,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:04,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:04,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142129755] [2025-02-05 14:49:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142129755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:04,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:04,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:49:04,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220803328] [2025-02-05 14:49:04,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:04,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:49:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:04,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:49:04,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:04,706 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:05,004 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2025-02-05 14:49:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:49:05,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2025-02-05 14:49:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:05,006 INFO L225 Difference]: With dead ends: 290 [2025-02-05 14:49:05,007 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 14:49:05,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:49:05,008 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 138 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:05,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 83 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:49:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 14:49:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-02-05 14:49:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.0543478260869565) internal successors, (291), 287 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2025-02-05 14:49:05,013 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 245 [2025-02-05 14:49:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2025-02-05 14:49:05,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2025-02-05 14:49:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-05 14:49:05,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:05,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:05,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 14:49:05,016 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 380763658, now seen corresponding path program 1 times [2025-02-05 14:49:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511874166] [2025-02-05 14:49:05,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:05,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 14:49:05,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 14:49:05,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:05,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:07,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:07,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511874166] [2025-02-05 14:49:07,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511874166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:07,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:07,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2025-02-05 14:49:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914918501] [2025-02-05 14:49:07,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:07,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-05 14:49:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:07,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-05 14:49:07,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2025-02-05 14:49:07,256 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:07,806 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2025-02-05 14:49:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 14:49:07,806 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-02-05 14:49:07,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:07,807 INFO L225 Difference]: With dead ends: 291 [2025-02-05 14:49:07,808 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 14:49:07,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 14:49:07,809 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 226 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:07,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 126 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:49:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 14:49:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2025-02-05 14:49:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.050909090909091) internal successors, (289), 285 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2025-02-05 14:49:07,813 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 248 [2025-02-05 14:49:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2025-02-05 14:49:07,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.875) internal successors, (248), 64 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2025-02-05 14:49:07,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-02-05 14:49:07,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:07,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:07,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 14:49:07,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:07,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:07,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1081224853, now seen corresponding path program 1 times [2025-02-05 14:49:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658019176] [2025-02-05 14:49:07,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:07,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-02-05 14:49:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-02-05 14:49:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:11,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:11,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658019176] [2025-02-05 14:49:11,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658019176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:11,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:11,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:49:11,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756666026] [2025-02-05 14:49:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:11,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:49:11,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:11,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:49:11,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:11,169 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:11,479 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2025-02-05 14:49:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:49:11,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-02-05 14:49:11,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:11,481 INFO L225 Difference]: With dead ends: 286 [2025-02-05 14:49:11,481 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 14:49:11,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:49:11,481 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:11,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 97 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:49:11,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 14:49:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-02-05 14:49:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 274 states have (on average 1.0474452554744527) internal successors, (287), 283 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 287 transitions. [2025-02-05 14:49:11,485 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 287 transitions. Word has length 249 [2025-02-05 14:49:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 287 transitions. [2025-02-05 14:49:11,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 287 transitions. [2025-02-05 14:49:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 14:49:11,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:11,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:11,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 14:49:11,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:11,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash 325037843, now seen corresponding path program 1 times [2025-02-05 14:49:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:11,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723395550] [2025-02-05 14:49:11,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:11,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:11,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 14:49:11,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 14:49:11,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:11,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723395550] [2025-02-05 14:49:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723395550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:11,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:11,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:49:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998995910] [2025-02-05 14:49:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:49:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:11,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:49:11,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:11,665 INFO L87 Difference]: Start difference. First operand 284 states and 287 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:11,802 INFO L93 Difference]: Finished difference Result 284 states and 287 transitions. [2025-02-05 14:49:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:49:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-02-05 14:49:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:11,805 INFO L225 Difference]: With dead ends: 284 [2025-02-05 14:49:11,805 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 14:49:11,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:49:11,806 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:11,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 314 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:49:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 14:49:11,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-02-05 14:49:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 273 states have (on average 1.043956043956044) internal successors, (285), 281 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2025-02-05 14:49:11,810 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 251 [2025-02-05 14:49:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:11,811 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2025-02-05 14:49:11,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2025-02-05 14:49:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-02-05 14:49:11,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:11,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:11,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 14:49:11,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:11,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1486239335, now seen corresponding path program 1 times [2025-02-05 14:49:11,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:11,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044897151] [2025-02-05 14:49:11,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:11,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-05 14:49:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-05 14:49:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044897151] [2025-02-05 14:49:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044897151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:49:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290303562] [2025-02-05 14:49:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:11,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:49:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:11,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:49:11,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:11,960 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:12,141 INFO L93 Difference]: Finished difference Result 282 states and 285 transitions. [2025-02-05 14:49:12,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:49:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-02-05 14:49:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:12,142 INFO L225 Difference]: With dead ends: 282 [2025-02-05 14:49:12,142 INFO L226 Difference]: Without dead ends: 278 [2025-02-05 14:49:12,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:12,143 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 5 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:12,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 574 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:49:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-05 14:49:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-05 14:49:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 270 states have (on average 1.0407407407407407) internal successors, (281), 277 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2025-02-05 14:49:12,147 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 252 [2025-02-05 14:49:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:12,148 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2025-02-05 14:49:12,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2025-02-05 14:49:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 14:49:12,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:12,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:12,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 14:49:12,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:12,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1098632549, now seen corresponding path program 1 times [2025-02-05 14:49:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268047726] [2025-02-05 14:49:12,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:12,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 14:49:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 14:49:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268047726] [2025-02-05 14:49:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268047726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-05 14:49:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050285223] [2025-02-05 14:49:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:13,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-05 14:49:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:13,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-05 14:49:13,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 14:49:13,951 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:14,449 INFO L93 Difference]: Finished difference Result 288 states and 292 transitions. [2025-02-05 14:49:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-05 14:49:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-02-05 14:49:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:14,450 INFO L225 Difference]: With dead ends: 288 [2025-02-05 14:49:14,450 INFO L226 Difference]: Without dead ends: 286 [2025-02-05 14:49:14,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-05 14:49:14,451 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 93 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:14,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:49:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-05 14:49:14,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 276. [2025-02-05 14:49:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 269 states have (on average 1.037174721189591) internal successors, (279), 275 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2025-02-05 14:49:14,455 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 253 [2025-02-05 14:49:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:14,455 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2025-02-05 14:49:14,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2025-02-05 14:49:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-02-05 14:49:14,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:14,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:14,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:49:14,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:14,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:14,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1099263143, now seen corresponding path program 1 times [2025-02-05 14:49:14,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:14,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072248815] [2025-02-05 14:49:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:14,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:14,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-02-05 14:49:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-02-05 14:49:14,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:14,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072248815] [2025-02-05 14:49:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072248815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-05 14:49:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983525372] [2025-02-05 14:49:16,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:16,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-05 14:49:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-05 14:49:16,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 14:49:16,222 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:16,730 INFO L93 Difference]: Finished difference Result 286 states and 290 transitions. [2025-02-05 14:49:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-05 14:49:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-02-05 14:49:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:16,731 INFO L225 Difference]: With dead ends: 286 [2025-02-05 14:49:16,731 INFO L226 Difference]: Without dead ends: 284 [2025-02-05 14:49:16,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-05 14:49:16,733 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:16,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 85 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:49:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-02-05 14:49:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2025-02-05 14:49:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.0335820895522387) internal successors, (277), 273 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2025-02-05 14:49:16,736 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 253 [2025-02-05 14:49:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:16,736 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2025-02-05 14:49:16,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.8923076923076922) internal successors, (253), 65 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:16,737 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2025-02-05 14:49:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 14:49:16,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:16,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:16,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 14:49:16,738 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:16,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash 302174892, now seen corresponding path program 1 times [2025-02-05 14:49:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566950677] [2025-02-05 14:49:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:16,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 14:49:16,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 14:49:16,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:16,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566950677] [2025-02-05 14:49:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566950677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:18,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:18,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-02-05 14:49:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838236633] [2025-02-05 14:49:18,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:18,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-02-05 14:49:18,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:18,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-02-05 14:49:18,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-02-05 14:49:18,587 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:19,071 INFO L93 Difference]: Finished difference Result 284 states and 288 transitions. [2025-02-05 14:49:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-02-05 14:49:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-02-05 14:49:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:19,072 INFO L225 Difference]: With dead ends: 284 [2025-02-05 14:49:19,072 INFO L226 Difference]: Without dead ends: 282 [2025-02-05 14:49:19,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-02-05 14:49:19,073 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 87 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:19,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 84 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 14:49:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-02-05 14:49:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 272. [2025-02-05 14:49:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 267 states have (on average 1.0299625468164795) internal successors, (275), 271 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 275 transitions. [2025-02-05 14:49:19,077 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 275 transitions. Word has length 254 [2025-02-05 14:49:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 275 transitions. [2025-02-05 14:49:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.9076923076923076) internal successors, (254), 65 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 275 transitions. [2025-02-05 14:49:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 14:49:19,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:19,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:19,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 14:49:19,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 302130214, now seen corresponding path program 1 times [2025-02-05 14:49:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:19,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400041412] [2025-02-05 14:49:19,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:19,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 14:49:19,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 14:49:19,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:19,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400041412] [2025-02-05 14:49:22,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400041412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:22,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:22,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:49:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779057065] [2025-02-05 14:49:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:22,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:49:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:22,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:49:22,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:22,326 INFO L87 Difference]: Start difference. First operand 272 states and 275 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:22,552 INFO L93 Difference]: Finished difference Result 272 states and 275 transitions. [2025-02-05 14:49:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:49:22,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-02-05 14:49:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:22,554 INFO L225 Difference]: With dead ends: 272 [2025-02-05 14:49:22,554 INFO L226 Difference]: Without dead ends: 268 [2025-02-05 14:49:22,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:22,554 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:22,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 41 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:49:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-05 14:49:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-05 14:49:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 264 states have (on average 1.0265151515151516) internal successors, (271), 267 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2025-02-05 14:49:22,558 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 254 [2025-02-05 14:49:22,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:22,558 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2025-02-05 14:49:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2025-02-05 14:49:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 14:49:22,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:22,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:22,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 14:49:22,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:22,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash 282582335, now seen corresponding path program 1 times [2025-02-05 14:49:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072320439] [2025-02-05 14:49:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:22,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 14:49:22,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 14:49:22,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:25,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:25,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072320439] [2025-02-05 14:49:25,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072320439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:25,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:49:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205266337] [2025-02-05 14:49:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:25,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:49:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:25,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:49:25,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:25,955 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:26,184 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2025-02-05 14:49:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:49:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-02-05 14:49:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:26,186 INFO L225 Difference]: With dead ends: 268 [2025-02-05 14:49:26,186 INFO L226 Difference]: Without dead ends: 266 [2025-02-05 14:49:26,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:49:26,187 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:26,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 42 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:49:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-05 14:49:26,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-02-05 14:49:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 263 states have (on average 1.0228136882129277) internal successors, (269), 265 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2025-02-05 14:49:26,190 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 254 [2025-02-05 14:49:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:26,190 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2025-02-05 14:49:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2025-02-05 14:49:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-02-05 14:49:26,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:26,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:26,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 14:49:26,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:26,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 777487967, now seen corresponding path program 1 times [2025-02-05 14:49:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481249416] [2025-02-05 14:49:26,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:26,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-02-05 14:49:26,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-02-05 14:49:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:29,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:29,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481249416] [2025-02-05 14:49:29,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481249416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:29,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:29,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 14:49:29,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587576506] [2025-02-05 14:49:29,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:29,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 14:49:29,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:29,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 14:49:29,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 14:49:29,396 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:29,625 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2025-02-05 14:49:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 14:49:29,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-02-05 14:49:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:29,626 INFO L225 Difference]: With dead ends: 266 [2025-02-05 14:49:29,626 INFO L226 Difference]: Without dead ends: 264 [2025-02-05 14:49:29,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 14:49:29,627 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:29,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:49:29,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-05 14:49:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-02-05 14:49:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 262 states have (on average 1.0190839694656488) internal successors, (267), 263 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 267 transitions. [2025-02-05 14:49:29,629 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 267 transitions. Word has length 255 [2025-02-05 14:49:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 267 transitions. [2025-02-05 14:49:29,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 267 transitions. [2025-02-05 14:49:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-02-05 14:49:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:29,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 14:49:29,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:29,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash 978721063, now seen corresponding path program 1 times [2025-02-05 14:49:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:29,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136606669] [2025-02-05 14:49:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:29,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-02-05 14:49:29,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-02-05 14:49:29,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:29,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:29,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136606669] [2025-02-05 14:49:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136606669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:29,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:49:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364344948] [2025-02-05 14:49:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:29,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:49:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:29,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:49:29,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:29,792 INFO L87 Difference]: Start difference. First operand 264 states and 267 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:29,890 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2025-02-05 14:49:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:49:29,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-02-05 14:49:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:29,891 INFO L225 Difference]: With dead ends: 264 [2025-02-05 14:49:29,891 INFO L226 Difference]: Without dead ends: 262 [2025-02-05 14:49:29,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:49:29,892 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:29,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 276 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:49:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-05 14:49:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-05 14:49:29,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.0153256704980842) internal successors, (265), 261 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 265 transitions. [2025-02-05 14:49:29,895 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 265 transitions. Word has length 256 [2025-02-05 14:49:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:29,895 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 265 transitions. [2025-02-05 14:49:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 265 transitions. [2025-02-05 14:49:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 14:49:29,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:49:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 14:49:29,896 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-05 14:49:29,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:49:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash 275582701, now seen corresponding path program 1 times [2025-02-05 14:49:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:49:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127087061] [2025-02-05 14:49:29,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:49:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:49:29,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 14:49:29,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 14:49:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:49:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:49:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:49:30,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:49:30,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127087061] [2025-02-05 14:49:30,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127087061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:49:30,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:49:30,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:49:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808295124] [2025-02-05 14:49:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:49:30,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:49:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:49:30,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:49:30,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:30,043 INFO L87 Difference]: Start difference. First operand 262 states and 265 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:49:30,202 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2025-02-05 14:49:30,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:49:30,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-05 14:49:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:49:30,203 INFO L225 Difference]: With dead ends: 262 [2025-02-05 14:49:30,203 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 14:49:30,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:49:30,204 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 3 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:49:30,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 522 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:49:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 14:49:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 14:49:30,205 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-05 14:49:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 14:49:30,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 257 [2025-02-05 14:49:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:49:30,205 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 14:49:30,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:49:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 14:49:30,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-05 14:49:30,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-05 14:49:30,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-05 14:49:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 14:49:30,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:49:30,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 14:49:30,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:49:30,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:49:30 BoogieIcfgContainer [2025-02-05 14:49:30,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:49:30,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:49:30,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:49:30,218 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:49:30,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:48:54" (3/4) ... [2025-02-05 14:49:30,220 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 14:49:30,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 14:49:30,250 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 14:49:30,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 14:49:30,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 14:49:30,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:49:30,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:49:30,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:49:30,402 INFO L158 Benchmark]: Toolchain (without parser) took 39251.29ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 101.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 520.7MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1040.86ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 45.6MB in the end (delta: 56.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 187.97ms. Allocated memory is still 142.6MB. Free memory was 45.6MB in the beginning and 97.3MB in the end (delta: -51.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: Boogie Preprocessor took 110.12ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 87.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: IcfgBuilder took 1857.71ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 87.3MB in the beginning and 218.3MB in the end (delta: -131.0MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: TraceAbstraction took 35864.93ms. Allocated memory was 352.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 217.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 388.5MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,403 INFO L158 Benchmark]: Witness Printer took 184.02ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 14:49:30,405 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1040.86ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 45.6MB in the end (delta: 56.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 187.97ms. Allocated memory is still 142.6MB. Free memory was 45.6MB in the beginning and 97.3MB in the end (delta: -51.7MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.12ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 87.3MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1857.71ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 87.3MB in the beginning and 218.3MB in the end (delta: -131.0MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * TraceAbstraction took 35864.93ms. Allocated memory was 352.3MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 217.3MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 388.5MB. Max. memory is 16.1GB. * Witness Printer took 184.02ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 33.3MB). 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: 41]: 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: 53]: 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: 4678]: 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: 4690]: 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: 4714]: 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: 4726]: 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: 4743]: 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: 4755]: 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: 4783]: 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: 4795]: 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: 4811]: 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: 4823]: 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: 4854]: 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: 4866]: 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: 4893]: 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: 4905]: 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, 475 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1668 mSDsluCounter, 3936 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2181 mSDsCounter, 389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14060 IncrementalHoareTripleChecker+Invalid, 14449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 389 mSolverCounterUnsat, 1755 mSDtfsCounter, 14060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 977 GetRequests, 610 SyntacticMatches, 5 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=475occurred in iteration=0, InterpolantAutomatonStates: 371, 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, 16 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 28.7s InterpolantComputationTime, 3540 NumberOfCodeBlocks, 3540 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3524 ConstructedInterpolants, 0 QuantifiedInterpolants, 10153 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-05 14:49:30,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE