./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:50:26,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:50:26,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:50:26,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:50:26,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:50:26,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:50:26,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:50:26,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:50:26,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:50:26,642 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:50:26,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:50:26,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:50:26,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:50:26,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:50:26,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:50:26,644 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:26,644 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:50:26,644 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:50:26,645 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b8ad5d8740269626905d9d5a2468afdc53741ffbc53080bd6ac9ee1933c3998 [2025-03-16 17:50:26,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:50:26,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:50:26,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:50:26,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:50:26,849 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:50:26,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-03-16 17:50:27,982 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba8047a5/32bdb4d0473f41f985eac379fcde32fa/FLAGc02ff35d5 [2025-03-16 17:50:28,310 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:50:28,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2025-03-16 17:50:28,332 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba8047a5/32bdb4d0473f41f985eac379fcde32fa/FLAGc02ff35d5 [2025-03-16 17:50:28,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba8047a5/32bdb4d0473f41f985eac379fcde32fa [2025-03-16 17:50:28,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:50:28,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:50:28,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:28,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:50:28,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:50:28,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c449044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:28, skipping insertion in model container [2025-03-16 17:50:28,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:50:28" (1/1) ... [2025-03-16 17:50:28,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:50:28,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-03-16 17:50:28,714 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-03-16 17:50:28,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-03-16 17:50:28,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-03-16 17:50:28,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-03-16 17:50:28,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-03-16 17:50:28,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-03-16 17:50:28,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-03-16 17:50:28,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-03-16 17:50:28,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-03-16 17:50:28,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-03-16 17:50:28,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-03-16 17:50:28,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-03-16 17:50:28,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-03-16 17:50:28,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-03-16 17:50:28,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-03-16 17:50:28,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:28,972 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:50:28,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1000,1013] [2025-03-16 17:50:28,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[1215,1228] [2025-03-16 17:50:29,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83573,83586] [2025-03-16 17:50:29,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2025-03-16 17:50:29,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2025-03-16 17:50:29,102 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2025-03-16 17:50:29,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84801,84814] [2025-03-16 17:50:29,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2025-03-16 17:50:29,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85521,85534] [2025-03-16 17:50:29,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2025-03-16 17:50:29,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86050,86063] [2025-03-16 17:50:29,110 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86271,86284] [2025-03-16 17:50:29,111 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86594,86607] [2025-03-16 17:50:29,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[86815,86828] [2025-03-16 17:50:29,113 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87258,87271] [2025-03-16 17:50:29,115 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+sep-reducer.c[87479,87492] [2025-03-16 17:50:29,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:50:29,128 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:50:29,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29 WrapperNode [2025-03-16 17:50:29,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:50:29,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:29,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:50:29,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:50:29,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,209 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3587 [2025-03-16 17:50:29,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:50:29,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:50:29,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:50:29,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:50:29,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,254 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:50:29,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:50:29,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:50:29,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:50:29,318 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:50:29,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (1/1) ... [2025-03-16 17:50:29,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:50:29,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:50:29,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 17:50:29,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 17:50:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:50:29,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:50:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:50:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:50:29,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:50:29,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:50:30,741 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,742 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,743 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,744 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~main____CPAchecker_TMP_3~1#1; [2025-03-16 17:50:30,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc main_~main____CPAchecker_TMP_4~0#1; [2025-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,745 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L265: havoc main_~main____CPAchecker_TMP_4~1#1; [2025-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,746 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L401: havoc main_~main____CPAchecker_TMP_3~2#1; [2025-03-16 17:50:30,746 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L405: havoc main_~main____CPAchecker_TMP_4~2#1; [2025-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4767: havoc main_~main____CPAchecker_TMP_3~3#1; [2025-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,747 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4771: havoc main_~main____CPAchecker_TMP_4~3#1; [2025-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,748 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,749 INFO L1322 $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-03-16 17:50:30,833 INFO L? ?]: Removed 1160 outVars from TransFormulas that were not future-live. [2025-03-16 17:50:30,833 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:50:30,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:50:30,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:50:30,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:30 BoogieIcfgContainer [2025-03-16 17:50:30,852 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:50:30,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:50:30,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:50:30,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:50:30,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:50:28" (1/3) ... [2025-03-16 17:50:30,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aebaf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:30, skipping insertion in model container [2025-03-16 17:50:30,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:50:29" (2/3) ... [2025-03-16 17:50:30,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aebaf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:50:30, skipping insertion in model container [2025-03-16 17:50:30,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:30" (3/3) ... [2025-03-16 17:50:30,858 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2025-03-16 17:50:30,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:50:30,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.p+sep-reducer.c that has 1 procedures, 474 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-16 17:50:30,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:50:30,929 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;@17eff752, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:50:30,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-16 17:50:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 457 states have (on average 1.9693654266958425) internal successors, (900), 473 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 17:50:30,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:30,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 17:50:30,936 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-03-16 17:50:30,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash 120626400, now seen corresponding path program 1 times [2025-03-16 17:50:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902734316] [2025-03-16 17:50:30,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:30,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:31,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 17:50:31,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 17:50:31,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:31,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:31,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902734316] [2025-03-16 17:50:31,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902734316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:31,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:31,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:31,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112754381] [2025-03-16 17:50:31,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:31,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:31,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:31,156 INFO L87 Difference]: Start difference. First operand has 474 states, 457 states have (on average 1.9693654266958425) internal successors, (900), 473 states have internal predecessors, (900), 0 states have call successors, (0), 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.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:31,964 INFO L93 Difference]: Finished difference Result 478 states and 903 transitions. [2025-03-16 17:50:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-16 17:50:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:31,971 INFO L225 Difference]: With dead ends: 478 [2025-03-16 17:50:31,971 INFO L226 Difference]: Without dead ends: 296 [2025-03-16 17:50:31,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:31,974 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 703 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 710 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.8s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:31,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 710 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 17:50:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-16 17:50:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-16 17:50:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2775800711743772) internal successors, (359), 295 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2025-03-16 17:50:32,012 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 6 [2025-03-16 17:50:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:32,012 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2025-03-16 17:50:32,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2025-03-16 17:50:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:50:32,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:32,013 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:32,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:50:32,013 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-03-16 17:50:32,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:32,014 INFO L85 PathProgramCache]: Analyzing trace with hash -555549663, now seen corresponding path program 1 times [2025-03-16 17:50:32,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477917384] [2025-03-16 17:50:32,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:32,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:50:32,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:50:32,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:32,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477917384] [2025-03-16 17:50:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477917384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:32,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:32,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 17:50:32,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686008888] [2025-03-16 17:50:32,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:32,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 17:50:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:32,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 17:50:32,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 17:50:32,124 INFO L87 Difference]: Start difference. First operand 296 states and 359 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-03-16 17:50:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:32,490 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2025-03-16 17:50:32,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:32,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-03-16 17:50:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:32,492 INFO L225 Difference]: With dead ends: 296 [2025-03-16 17:50:32,492 INFO L226 Difference]: Without dead ends: 291 [2025-03-16 17:50:32,492 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-03-16 17:50:32,493 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 7 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:32,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 755 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:50:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-16 17:50:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-03-16 17:50:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 277 states have (on average 1.0613718411552346) internal successors, (294), 290 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:32,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2025-03-16 17:50:32,509 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 7 [2025-03-16 17:50:32,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:32,509 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2025-03-16 17:50:32,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-03-16 17:50:32,509 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2025-03-16 17:50:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-16 17:50:32,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:32,515 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] [2025-03-16 17:50:32,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:50:32,516 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-03-16 17:50:32,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -347893888, now seen corresponding path program 1 times [2025-03-16 17:50:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:32,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724123863] [2025-03-16 17:50:32,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-16 17:50:32,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-16 17:50:32,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:32,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724123863] [2025-03-16 17:50:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724123863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:36,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2025-03-16 17:50:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900033991] [2025-03-16 17:50:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:36,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-16 17:50:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-16 17:50:36,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2025-03-16 17:50:36,187 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:36,832 INFO L93 Difference]: Finished difference Result 291 states and 294 transitions. [2025-03-16 17:50:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-16 17:50:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-03-16 17:50:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:36,834 INFO L225 Difference]: With dead ends: 291 [2025-03-16 17:50:36,834 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 17:50:36,836 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-03-16 17:50:36,836 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 117 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:36,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 117 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:50:36,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 17:50:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2025-03-16 17:50:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 276 states have (on average 1.0579710144927537) internal successors, (292), 288 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2025-03-16 17:50:36,842 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 243 [2025-03-16 17:50:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:36,842 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2025-03-16 17:50:36,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.857142857142857) internal successors, (243), 63 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2025-03-16 17:50:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 17:50:36,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:36,844 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-03-16 17:50:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 17:50:36,844 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-03-16 17:50:36,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2100195730, now seen corresponding path program 1 times [2025-03-16 17:50:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714731919] [2025-03-16 17:50:36,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:36,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-16 17:50:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 17:50:36,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:36,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714731919] [2025-03-16 17:50:37,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714731919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:37,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:37,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361277441] [2025-03-16 17:50:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:37,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:37,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:37,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:37,300 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 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-03-16 17:50:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:37,684 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2025-03-16 17:50:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:37,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 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-03-16 17:50:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:37,688 INFO L225 Difference]: With dead ends: 289 [2025-03-16 17:50:37,688 INFO L226 Difference]: Without dead ends: 287 [2025-03-16 17:50:37,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:37,689 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 504 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:37,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 79 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 17:50:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-16 17:50:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-16 17:50:37,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 275 states have (on average 1.0545454545454545) internal successors, (290), 286 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2025-03-16 17:50:37,696 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 244 [2025-03-16 17:50:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:37,697 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2025-03-16 17:50:37,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 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-03-16 17:50:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2025-03-16 17:50:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-16 17:50:37,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:37,703 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] [2025-03-16 17:50:37,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 17:50:37,703 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-03-16 17:50:37,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2146511473, now seen corresponding path program 1 times [2025-03-16 17:50:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075489971] [2025-03-16 17:50:37,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:37,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-16 17:50:37,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-16 17:50:37,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:37,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075489971] [2025-03-16 17:50:40,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075489971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:40,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:40,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2025-03-16 17:50:40,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163586088] [2025-03-16 17:50:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:40,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-16 17:50:40,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:40,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-16 17:50:40,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1895, Invalid=2137, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 17:50:40,039 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:40,635 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2025-03-16 17:50:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 17:50:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-16 17:50:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:40,637 INFO L225 Difference]: With dead ends: 290 [2025-03-16 17:50:40,637 INFO L226 Difference]: Without dead ends: 288 [2025-03-16 17:50:40,638 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-03-16 17:50:40,638 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 98 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:40,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 100 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 17:50:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-16 17:50:40,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 285. [2025-03-16 17:50:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 274 states have (on average 1.051094890510949) internal successors, (288), 284 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2025-03-16 17:50:40,642 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 247 [2025-03-16 17:50:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:40,642 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2025-03-16 17:50:40,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.859375) internal successors, (247), 64 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2025-03-16 17:50:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-16 17:50:40,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:40,644 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-03-16 17:50:40,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 17:50:40,644 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-03-16 17:50:40,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:40,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2117349860, now seen corresponding path program 1 times [2025-03-16 17:50:40,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:40,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32347921] [2025-03-16 17:50:40,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:40,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-16 17:50:40,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-16 17:50:40,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:40,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:40,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:40,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32347921] [2025-03-16 17:50:40,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32347921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:40,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:40,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 17:50:40,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363353605] [2025-03-16 17:50:40,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:40,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:50:40,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:40,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:50:40,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:50:40,942 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 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-03-16 17:50:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:41,262 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2025-03-16 17:50:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 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-03-16 17:50:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:41,264 INFO L225 Difference]: With dead ends: 285 [2025-03-16 17:50:41,264 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 17:50:41,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:50:41,264 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 492 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:41,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 71 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:50:41,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 17:50:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-16 17:50:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 273 states have (on average 1.0476190476190477) internal successors, (286), 282 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 286 transitions. [2025-03-16 17:50:41,268 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 286 transitions. Word has length 248 [2025-03-16 17:50:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 286 transitions. [2025-03-16 17:50:41,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 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-03-16 17:50:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 286 transitions. [2025-03-16 17:50:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 17:50:41,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:41,270 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] [2025-03-16 17:50:41,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 17:50:41,271 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-03-16 17:50:41,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1041246900, now seen corresponding path program 1 times [2025-03-16 17:50:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908008796] [2025-03-16 17:50:41,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:41,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 17:50:41,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 17:50:41,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:41,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908008796] [2025-03-16 17:50:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908008796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:41,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:41,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488916906] [2025-03-16 17:50:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:41,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:41,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:41,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:41,467 INFO L87 Difference]: Start difference. First operand 283 states and 286 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:41,586 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2025-03-16 17:50:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-16 17:50:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:41,587 INFO L225 Difference]: With dead ends: 283 [2025-03-16 17:50:41,587 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 17:50:41,588 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-03-16 17:50:41,588 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 28 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 311 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-03-16 17:50:41,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 311 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:50:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 17:50:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-16 17:50:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 272 states have (on average 1.0441176470588236) internal successors, (284), 280 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2025-03-16 17:50:41,591 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 250 [2025-03-16 17:50:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:41,592 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2025-03-16 17:50:41,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2025-03-16 17:50:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 17:50:41,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:41,593 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:50:41,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 17:50:41,593 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-03-16 17:50:41,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2081085262, now seen corresponding path program 1 times [2025-03-16 17:50:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:41,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184643440] [2025-03-16 17:50:41,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:41,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 17:50:41,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 17:50:41,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:41,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:41,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:41,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184643440] [2025-03-16 17:50:41,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184643440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:41,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:41,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:50:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456100522] [2025-03-16 17:50:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:50:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:41,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:50:41,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:41,744 INFO L87 Difference]: Start difference. First operand 281 states and 284 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-03-16 17:50:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:41,915 INFO L93 Difference]: Finished difference Result 281 states and 284 transitions. [2025-03-16 17:50:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:50:41,916 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-03-16 17:50:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:41,917 INFO L225 Difference]: With dead ends: 281 [2025-03-16 17:50:41,917 INFO L226 Difference]: Without dead ends: 277 [2025-03-16 17:50:41,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:50:41,918 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 5 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 571 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-03-16 17:50:41,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 571 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:50:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-16 17:50:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-16 17:50:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 269 states have (on average 1.0408921933085502) internal successors, (280), 276 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2025-03-16 17:50:41,922 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 251 [2025-03-16 17:50:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:41,923 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2025-03-16 17:50:41,923 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-03-16 17:50:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2025-03-16 17:50:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 17:50:41,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:41,924 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-03-16 17:50:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 17:50:41,924 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-03-16 17:50:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash 161722004, now seen corresponding path program 1 times [2025-03-16 17:50:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692986037] [2025-03-16 17:50:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:41,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 17:50:41,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 17:50:41,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:41,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:43,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:43,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692986037] [2025-03-16 17:50:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692986037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:43,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-03-16 17:50:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183153381] [2025-03-16 17:50:43,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:43,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-16 17:50:43,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:43,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-16 17:50:43,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-03-16 17:50:43,836 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:44,344 INFO L93 Difference]: Finished difference Result 287 states and 291 transitions. [2025-03-16 17:50:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-16 17:50:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:44,346 INFO L225 Difference]: With dead ends: 287 [2025-03-16 17:50:44,346 INFO L226 Difference]: Without dead ends: 285 [2025-03-16 17:50:44,346 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-03-16 17:50:44,347 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 175 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:44,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 84 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:50:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-16 17:50:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2025-03-16 17:50:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.037313432835821) internal successors, (278), 274 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2025-03-16 17:50:44,351 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 252 [2025-03-16 17:50:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:44,352 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2025-03-16 17:50:44,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2025-03-16 17:50:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 17:50:44,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:44,353 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-03-16 17:50:44,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 17:50:44,353 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-03-16 17:50:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash 161091410, now seen corresponding path program 1 times [2025-03-16 17:50:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:44,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118875705] [2025-03-16 17:50:44,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:44,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 17:50:44,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 17:50:44,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:44,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118875705] [2025-03-16 17:50:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118875705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:46,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:46,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-03-16 17:50:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365142480] [2025-03-16 17:50:46,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:46,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-16 17:50:46,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:46,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-16 17:50:46,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-03-16 17:50:46,272 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:46,765 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2025-03-16 17:50:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-16 17:50:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:46,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:46,766 INFO L225 Difference]: With dead ends: 285 [2025-03-16 17:50:46,766 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 17:50:46,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2021, Invalid=2269, Unknown=0, NotChecked=0, Total=4290 [2025-03-16 17:50:46,767 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 102 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:46,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 78 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:50:46,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 17:50:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2025-03-16 17:50:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 267 states have (on average 1.0337078651685394) internal successors, (276), 272 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 276 transitions. [2025-03-16 17:50:46,772 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 276 transitions. Word has length 252 [2025-03-16 17:50:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:46,772 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 276 transitions. [2025-03-16 17:50:46,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.876923076923077) internal successors, (252), 65 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-03-16 17:50:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 276 transitions. [2025-03-16 17:50:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 17:50:46,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:46,773 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-03-16 17:50:46,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 17:50:46,774 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-03-16 17:50:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 718460371, now seen corresponding path program 1 times [2025-03-16 17:50:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676847724] [2025-03-16 17:50:46,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:46,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 17:50:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 17:50:46,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:46,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:48,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:48,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676847724] [2025-03-16 17:50:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676847724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:48,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:48,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2025-03-16 17:50:48,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591000823] [2025-03-16 17:50:48,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:48,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-16 17:50:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-16 17:50:48,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1957, Invalid=2203, Unknown=0, NotChecked=0, Total=4160 [2025-03-16 17:50:48,607 INFO L87 Difference]: Start difference. First operand 273 states and 276 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-03-16 17:50:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:49,112 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2025-03-16 17:50:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-16 17:50:49,113 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-03-16 17:50:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:49,114 INFO L225 Difference]: With dead ends: 283 [2025-03-16 17:50:49,114 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 17:50:49,115 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-03-16 17:50:49,115 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:49,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 64 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 17:50:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 17:50:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 271. [2025-03-16 17:50:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 266 states have (on average 1.0300751879699248) internal successors, (274), 270 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2025-03-16 17:50:49,119 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 253 [2025-03-16 17:50:49,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:49,119 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2025-03-16 17:50:49,119 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-03-16 17:50:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2025-03-16 17:50:49,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 17:50:49,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:49,120 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-03-16 17:50:49,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 17:50:49,120 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-03-16 17:50:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 718415693, now seen corresponding path program 1 times [2025-03-16 17:50:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637670365] [2025-03-16 17:50:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:49,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 17:50:49,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 17:50:49,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:49,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:52,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637670365] [2025-03-16 17:50:52,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637670365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:52,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:52,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:52,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400814926] [2025-03-16 17:50:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:52,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:52,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:52,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:52,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:52,594 INFO L87 Difference]: Start difference. First operand 271 states and 274 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:52,812 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2025-03-16 17:50:52,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:52,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:52,814 INFO L225 Difference]: With dead ends: 271 [2025-03-16 17:50:52,814 INFO L226 Difference]: Without dead ends: 267 [2025-03-16 17:50:52,814 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-03-16 17:50:52,814 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 37 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:52,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:50:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-16 17:50:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2025-03-16 17:50:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 263 states have (on average 1.026615969581749) internal successors, (270), 266 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2025-03-16 17:50:52,817 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 253 [2025-03-16 17:50:52,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:52,817 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2025-03-16 17:50:52,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2025-03-16 17:50:52,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 17:50:52,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:52,818 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-03-16 17:50:52,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 17:50:52,818 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-03-16 17:50:52,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:52,819 INFO L85 PathProgramCache]: Analyzing trace with hash 698867814, now seen corresponding path program 1 times [2025-03-16 17:50:52,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586155627] [2025-03-16 17:50:52,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:52,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 17:50:52,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 17:50:52,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:52,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:56,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:56,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:56,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586155627] [2025-03-16 17:50:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586155627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:56,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614851924] [2025-03-16 17:50:56,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:56,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:56,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:56,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:56,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:56,272 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:56,537 INFO L93 Difference]: Finished difference Result 267 states and 270 transitions. [2025-03-16 17:50:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:56,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:56,538 INFO L225 Difference]: With dead ends: 267 [2025-03-16 17:50:56,538 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 17:50:56,538 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-03-16 17:50:56,539 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 37 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.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:56,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 37 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:50:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 17:50:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-16 17:50:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 262 states have (on average 1.0229007633587786) internal successors, (268), 264 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2025-03-16 17:50:56,543 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 253 [2025-03-16 17:50:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2025-03-16 17:50:56,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 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-03-16 17:50:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2025-03-16 17:50:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 17:50:56,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:56,545 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-03-16 17:50:56,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 17:50:56,545 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-03-16 17:50:56,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash 797435928, now seen corresponding path program 1 times [2025-03-16 17:50:56,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:56,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102493737] [2025-03-16 17:50:56,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:56,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 17:50:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 17:50:56,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:50:56,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:50:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:50:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:50:59,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102493737] [2025-03-16 17:50:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102493737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:50:59,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:50:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 17:50:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224640380] [2025-03-16 17:50:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:50:59,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 17:50:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:50:59,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 17:50:59,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 17:50:59,710 INFO L87 Difference]: Start difference. First operand 265 states and 268 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-03-16 17:50:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:50:59,956 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2025-03-16 17:50:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 17:50:59,956 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-03-16 17:50:59,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:50:59,957 INFO L225 Difference]: With dead ends: 265 [2025-03-16 17:50:59,957 INFO L226 Difference]: Without dead ends: 263 [2025-03-16 17:50:59,957 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-03-16 17:50:59,957 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:50:59,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 29 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:50:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-16 17:50:59,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-03-16 17:50:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 261 states have (on average 1.0191570881226053) internal successors, (266), 262 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:50:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 266 transitions. [2025-03-16 17:50:59,960 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 266 transitions. Word has length 254 [2025-03-16 17:50:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:50:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 266 transitions. [2025-03-16 17:50:59,961 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-03-16 17:50:59,961 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 266 transitions. [2025-03-16 17:50:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 17:50:59,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:50:59,962 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-03-16 17:50:59,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 17:50:59,962 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-03-16 17:50:59,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:50:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1597107854, now seen corresponding path program 1 times [2025-03-16 17:50:59,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:50:59,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661515886] [2025-03-16 17:50:59,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:50:59,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:50:59,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 17:51:00,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 17:51:00,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:00,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661515886] [2025-03-16 17:51:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661515886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:51:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102028595] [2025-03-16 17:51:00,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:00,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:51:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:00,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:51:00,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:51:00,131 INFO L87 Difference]: Start difference. First operand 263 states and 266 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 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-03-16 17:51:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:00,235 INFO L93 Difference]: Finished difference Result 263 states and 266 transitions. [2025-03-16 17:51:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:51:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 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-03-16 17:51:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:00,237 INFO L225 Difference]: With dead ends: 263 [2025-03-16 17:51:00,237 INFO L226 Difference]: Without dead ends: 261 [2025-03-16 17:51:00,237 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-03-16 17:51:00,237 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 273 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-03-16 17:51:00,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 273 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-16 17:51:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-16 17:51:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.0153846153846153) internal successors, (264), 260 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:51:00,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 264 transitions. [2025-03-16 17:51:00,240 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 264 transitions. Word has length 255 [2025-03-16 17:51:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:00,240 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 264 transitions. [2025-03-16 17:51:00,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 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-03-16 17:51:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 264 transitions. [2025-03-16 17:51:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 17:51:00,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:51:00,241 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-03-16 17:51:00,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 17:51:00,241 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-03-16 17:51:00,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:51:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2029263258, now seen corresponding path program 1 times [2025-03-16 17:51:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:51:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327131529] [2025-03-16 17:51:00,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:51:00,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:51:00,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 17:51:00,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 17:51:00,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:51:00,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:51:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:51:00,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:51:00,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327131529] [2025-03-16 17:51:00,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327131529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:51:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:51:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 17:51:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521973080] [2025-03-16 17:51:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:51:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 17:51:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:51:00,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 17:51:00,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:51:00,373 INFO L87 Difference]: Start difference. First operand 261 states and 264 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-03-16 17:51:00,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:51:00,517 INFO L93 Difference]: Finished difference Result 261 states and 264 transitions. [2025-03-16 17:51:00,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 17:51:00,517 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-03-16 17:51:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:51:00,517 INFO L225 Difference]: With dead ends: 261 [2025-03-16 17:51:00,517 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 17:51:00,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 17:51:00,518 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 3 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 519 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:51:00,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 519 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:51:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 17:51:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 17:51:00,519 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-03-16 17:51:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 17:51:00,519 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2025-03-16 17:51:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:51:00,519 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 17:51:00,519 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-03-16 17:51:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 17:51:00,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-03-16 17:51:00,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-03-16 17:51:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 17:51:00,523 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:51:00,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 17:51:00,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 17:51:00,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 05:51:00 BoogieIcfgContainer [2025-03-16 17:51:00,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 17:51:00,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 17:51:00,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 17:51:00,533 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 17:51:00,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:50:30" (3/4) ... [2025-03-16 17:51:00,534 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 17:51:00,564 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 17:51:00,567 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 17:51:00,569 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 17:51:00,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 17:51:00,699 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 17:51:00,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 17:51:00,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 17:51:00,700 INFO L158 Benchmark]: Toolchain (without parser) took 32165.32ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 119.8MB in the beginning and 953.4MB in the end (delta: -833.6MB). Peak memory consumption was 485.0MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,701 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 17:51:00,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.38ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 64.0MB in the end (delta: 55.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.99ms. Allocated memory is still 167.8MB. Free memory was 64.0MB in the beginning and 51.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,701 INFO L158 Benchmark]: Boogie Preprocessor took 106.42ms. Allocated memory is still 167.8MB. Free memory was 51.9MB in the beginning and 41.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,701 INFO L158 Benchmark]: IcfgBuilder took 1535.45ms. Allocated memory is still 167.8MB. Free memory was 41.8MB in the beginning and 99.2MB in the end (delta: -57.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,702 INFO L158 Benchmark]: TraceAbstraction took 29678.27ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 986.8MB in the end (delta: -887.6MB). Peak memory consumption was 429.3MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,702 INFO L158 Benchmark]: Witness Printer took 167.52ms. Allocated memory is still 1.5GB. Free memory was 986.8MB in the beginning and 953.4MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 17:51:00,703 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.12ms. Allocated memory is still 201.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 593.38ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 64.0MB in the end (delta: 55.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.99ms. Allocated memory is still 167.8MB. Free memory was 64.0MB in the beginning and 51.9MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.42ms. Allocated memory is still 167.8MB. Free memory was 51.9MB in the beginning and 41.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1535.45ms. Allocated memory is still 167.8MB. Free memory was 41.8MB in the beginning and 99.2MB in the end (delta: -57.3MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29678.27ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 986.8MB in the end (delta: -887.6MB). Peak memory consumption was 429.3MB. Max. memory is 16.1GB. * Witness Printer took 167.52ms. Allocated memory is still 1.5GB. Free memory was 986.8MB in the beginning and 953.4MB in the end (delta: 33.4MB). 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, 474 locations, 900 edges, 16 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2451 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2451 mSDsluCounter, 3835 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2096 mSDsCounter, 667 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14048 IncrementalHoareTripleChecker+Invalid, 14715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 667 mSolverCounterUnsat, 1739 mSDtfsCounter, 14048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 751 GetRequests, 386 SyntacticMatches, 3 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred 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.5s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 3524 NumberOfCodeBlocks, 3524 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3508 ConstructedInterpolants, 0 QuantifiedInterpolants, 8972 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-03-16 17:51:00,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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