./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8954b1975c9ef274050a4ed05b880cddaf4747278343623028f38a4ef8e6ca73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:32:12,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:32:12,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:32:12,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:32:12,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:32:12,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:32:12,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:32:12,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:32:12,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:32:12,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:32:12,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:32:12,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:32:12,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:32:12,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:32:12,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:32:12,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:32:12,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:32:12,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:32:12,523 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:32:12,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:32:12,523 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8954b1975c9ef274050a4ed05b880cddaf4747278343623028f38a4ef8e6ca73 [2025-03-08 19:32:12,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:32:12,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:32:12,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:32:12,773 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:32:12,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:32:12,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2025-03-08 19:32:13,887 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4a9e54/c03fef53bc8341959bf89d1a7bd84cbd/FLAGe4934a5a1 [2025-03-08 19:32:14,237 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:32:14,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2025-03-08 19:32:14,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4a9e54/c03fef53bc8341959bf89d1a7bd84cbd/FLAGe4934a5a1 [2025-03-08 19:32:14,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0e4a9e54/c03fef53bc8341959bf89d1a7bd84cbd [2025-03-08 19:32:14,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:32:14,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:32:14,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:32:14,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:32:14,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:32:14,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:14" (1/1) ... [2025-03-08 19:32:14,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3ad7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:14, skipping insertion in model container [2025-03-08 19:32:14,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:32:14" (1/1) ... [2025-03-08 19:32:14,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:32:15,020 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] [2025-03-08 19:32:15,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:32:15,059 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:32:15,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [3196] [2025-03-08 19:32:15,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3204-3205] [2025-03-08 19:32:15,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [3242] [2025-03-08 19:32:15,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [3250] [2025-03-08 19:32:15,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (data + i), "i" (1UL)); [3602-3603] [2025-03-08 19:32:15,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (uarg.i): "ebx"); [3692] [2025-03-08 19:32:15,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (uarg.i): "ebx"); [3695] [2025-03-08 19:32:15,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (uarg.i): "ebx"); [3698] [2025-03-08 19:32:15,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (uarg.i): "ebx"); [3701] [2025-03-08 19:32:15,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (uarg.i): "ebx"); [3704] [2025-03-08 19:32:15,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (uarg.i): "ebx"); [3715-3716] [2025-03-08 19:32:15,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (uarg.i): "ebx"); [3719-3720] [2025-03-08 19:32:15,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (uarg.i): "ebx"); [3723-3724] [2025-03-08 19:32:15,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (uarg.i): "ebx"); [3727-3728] [2025-03-08 19:32:15,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___0): "0" (__pu_val___0), "c" (uarg.i): "ebx"); [3731-3732] [2025-03-08 19:32:15,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (uarg.i), "i" (4UL)); [3741-3742] [2025-03-08 19:32:15,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu___0), "=r" (__val_gu___0): "0" (uarg.i), "i" (4UL)); [3765-3766] [2025-03-08 19:32:15,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (uarg.i): "ebx"); [3786-3787] [2025-03-08 19:32:15,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (uarg.i): "ebx"); [3790-3791] [2025-03-08 19:32:15,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (uarg.i): "ebx"); [3794-3795] [2025-03-08 19:32:15,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (uarg.i): "ebx"); [3798-3799] [2025-03-08 19:32:15,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu___1): "0" (__pu_val___1), "c" (uarg.i): "ebx"); [3802-3803] [2025-03-08 19:32:15,187 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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i[115866,115879] [2025-03-08 19:32:15,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:32:15,220 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:32:15,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15 WrapperNode [2025-03-08 19:32:15,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:32:15,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:32:15,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:32:15,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:32:15,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,291 INFO L138 Inliner]: procedures = 101, calls = 323, calls flagged for inlining = 40, calls inlined = 37, statements flattened = 941 [2025-03-08 19:32:15,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:32:15,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:32:15,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:32:15,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:32:15,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,348 INFO L175 MemorySlicer]: Split 104 memory accesses to 13 slices as follows [2, 1, 3, 0, 1, 1, 8, 9, 26, 29, 12, 10, 2]. 28 percent of accesses are in the largest equivalence class. The 24 initializations are split as follows [2, 0, 3, 0, 1, 0, 8, 0, 0, 0, 0, 10, 0]. The 71 writes are split as follows [0, 0, 0, 0, 0, 1, 0, 2, 26, 29, 12, 0, 1]. [2025-03-08 19:32:15,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:32:15,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:32:15,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:32:15,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:32:15,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (1/1) ... [2025-03-08 19:32:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:32:15,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:15,440 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-08 19:32:15,446 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-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-03-08 19:32:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:32:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:32:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:32:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:32:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:32:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_disable_sw_wd_trg [2025-03-08 19:32:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_disable_sw_wd_trg [2025-03-08 19:32:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_reboot_notifier [2025-03-08 19:32:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_reboot_notifier [2025-03-08 19:32:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_enable_sw_wd_trg [2025-03-08 19:32:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_enable_sw_wd_trg [2025-03-08 19:32:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-08 19:32:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_write [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_write [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_disable [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_disable [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_disable_sw_wd_tren [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_disable_sw_wd_tren [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-08 19:32:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_refresh [2025-03-08 19:32:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_refresh [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_enable_sw_wd_tren [2025-03-08 19:32:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_enable_sw_wd_tren [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:32:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:32:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:32:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_enable [2025-03-08 19:32:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_enable [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:32:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_enable_wden [2025-03-08 19:32:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_enable_wden [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:32:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:32:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-08 19:32:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure outb_p [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure outb_p [2025-03-08 19:32:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-08 19:32:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2025-03-08 19:32:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-08 19:32:15,472 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2025-03-08 19:32:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_swc_bank3 [2025-03-08 19:32:15,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_swc_bank3 [2025-03-08 19:32:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:32:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:32:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure pc87413_programm_wdto [2025-03-08 19:32:15,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pc87413_programm_wdto [2025-03-08 19:32:15,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:32:15,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:32:15,765 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4254: havoc #t~nondet129; [2025-03-08 19:32:15,768 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:32:15,787 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4274: havoc #t~nondet134; [2025-03-08 19:32:15,920 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4266: havoc #t~nondet132; [2025-03-08 19:32:15,968 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4237: havoc #t~ret127#1.base, #t~ret127#1.offset; [2025-03-08 19:32:22,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4270: havoc register_reboot_notifier_#t~nondet133#1; [2025-03-08 19:32:22,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4241: havoc _copy_to_user_#t~nondet128#1; [2025-03-08 19:32:22,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4258: havoc misc_register_#t~nondet130#1; [2025-03-08 19:32:22,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3914: call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset);havoc main_~#ldvarg8~0#1.base, main_~#ldvarg8~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset; [2025-03-08 19:32:22,931 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4262: havoc no_llseek_#t~nondet131#1; [2025-03-08 19:32:23,057 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2025-03-08 19:32:23,057 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:32:23,083 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:32:23,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:32:23,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:23 BoogieIcfgContainer [2025-03-08 19:32:23,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:32:23,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:32:23,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:32:23,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:32:23,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:32:14" (1/3) ... [2025-03-08 19:32:23,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34456363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:23, skipping insertion in model container [2025-03-08 19:32:23,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:32:15" (2/3) ... [2025-03-08 19:32:23,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34456363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:32:23, skipping insertion in model container [2025-03-08 19:32:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:32:23" (3/3) ... [2025-03-08 19:32:23,096 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i [2025-03-08 19:32:23,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:32:23,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--watchdog--pc87413_wdt.ko-entry_point.cil.out.i that has 28 procedures, 399 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 19:32:23,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:32:23,185 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;@1fd8d97b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:32:23,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:32:23,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 398 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 272 states have internal predecessors, (351), 108 states have call successors, (108), 27 states have call predecessors, (108), 26 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 19:32:23,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 19:32:23,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:23,205 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:23,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:23,209 INFO L85 PathProgramCache]: Analyzing trace with hash 82033752, now seen corresponding path program 1 times [2025-03-08 19:32:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:23,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908182462] [2025-03-08 19:32:23,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:23,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:32:23,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:32:23,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:23,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 19:32:23,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:23,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908182462] [2025-03-08 19:32:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908182462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411362116] [2025-03-08 19:32:23,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:23,778 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:23,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:32:24,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:32:24,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:32:24,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:24,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:24,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 19:32:24,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:32:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 19:32:24,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:32:24,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411362116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:32:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 19:32:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496114182] [2025-03-08 19:32:24,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:24,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:32:24,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:24,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:32:24,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:32:24,334 INFO L87 Difference]: Start difference. First operand has 398 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 272 states have internal predecessors, (351), 108 states have call successors, (108), 27 states have call predecessors, (108), 26 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 19:32:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:24,409 INFO L93 Difference]: Finished difference Result 791 states and 1144 transitions. [2025-03-08 19:32:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:32:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2025-03-08 19:32:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:24,423 INFO L225 Difference]: With dead ends: 791 [2025-03-08 19:32:24,423 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 19:32:24,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:32:24,433 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:24,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 551 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 19:32:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2025-03-08 19:32:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 257 states have (on average 1.3035019455252919) internal successors, (335), 261 states have internal predecessors, (335), 104 states have call successors, (104), 26 states have call predecessors, (104), 25 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 19:32:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 542 transitions. [2025-03-08 19:32:24,504 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 542 transitions. Word has length 136 [2025-03-08 19:32:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:24,505 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 542 transitions. [2025-03-08 19:32:24,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 19:32:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 542 transitions. [2025-03-08 19:32:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 19:32:24,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:24,513 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:24,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 19:32:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 19:32:24,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:24,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash 928705116, now seen corresponding path program 1 times [2025-03-08 19:32:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729697260] [2025-03-08 19:32:24,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:24,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:32:24,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:32:24,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:24,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 19:32:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729697260] [2025-03-08 19:32:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729697260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:25,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:32:25,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379218189] [2025-03-08 19:32:25,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:25,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:32:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:25,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:32:25,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:32:25,145 INFO L87 Difference]: Start difference. First operand 387 states and 542 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 19:32:29,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:29,249 INFO L93 Difference]: Finished difference Result 754 states and 1055 transitions. [2025-03-08 19:32:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:32:29,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2025-03-08 19:32:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:29,254 INFO L225 Difference]: With dead ends: 754 [2025-03-08 19:32:29,254 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 19:32:29,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 19:32:29,255 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 6 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:29,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1598 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:32:29,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 19:32:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 390. [2025-03-08 19:32:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 260 states have (on average 1.3) internal successors, (338), 264 states have internal predecessors, (338), 104 states have call successors, (104), 26 states have call predecessors, (104), 25 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 19:32:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 545 transitions. [2025-03-08 19:32:29,279 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 545 transitions. Word has length 136 [2025-03-08 19:32:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:29,280 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 545 transitions. [2025-03-08 19:32:29,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 19:32:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 545 transitions. [2025-03-08 19:32:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 19:32:29,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:29,283 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:29,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:32:29,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:29,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 957334267, now seen corresponding path program 1 times [2025-03-08 19:32:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57686206] [2025-03-08 19:32:29,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:29,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 19:32:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 19:32:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 19:32:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:29,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57686206] [2025-03-08 19:32:29,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57686206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:29,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102321004] [2025-03-08 19:32:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:29,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:29,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:29,561 INFO L87 Difference]: Start difference. First operand 390 states and 545 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 19:32:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:29,631 INFO L93 Difference]: Finished difference Result 752 states and 1052 transitions. [2025-03-08 19:32:29,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:29,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 19:32:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:29,640 INFO L225 Difference]: With dead ends: 752 [2025-03-08 19:32:29,640 INFO L226 Difference]: Without dead ends: 730 [2025-03-08 19:32:29,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:29,641 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 499 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:29,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1050 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-08 19:32:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 730. [2025-03-08 19:32:29,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 489 states have (on average 1.30879345603272) internal successors, (640), 497 states have internal predecessors, (640), 191 states have call successors, (191), 50 states have call predecessors, (191), 49 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-03-08 19:32:29,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1021 transitions. [2025-03-08 19:32:29,675 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1021 transitions. Word has length 136 [2025-03-08 19:32:29,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:29,676 INFO L471 AbstractCegarLoop]: Abstraction has 730 states and 1021 transitions. [2025-03-08 19:32:29,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 19:32:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1021 transitions. [2025-03-08 19:32:29,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-08 19:32:29,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:29,684 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:29,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:32:29,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -939833650, now seen corresponding path program 1 times [2025-03-08 19:32:29,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:29,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409245480] [2025-03-08 19:32:29,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:29,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:29,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 284 statements into 1 equivalence classes. [2025-03-08 19:32:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 284 of 284 statements. [2025-03-08 19:32:29,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:29,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-08 19:32:30,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409245480] [2025-03-08 19:32:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409245480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726048218] [2025-03-08 19:32:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:30,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:30,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:30,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:30,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:30,044 INFO L87 Difference]: Start difference. First operand 730 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 19:32:31,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:31,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:31,652 INFO L93 Difference]: Finished difference Result 1676 states and 2295 transitions. [2025-03-08 19:32:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 284 [2025-03-08 19:32:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:31,662 INFO L225 Difference]: With dead ends: 1676 [2025-03-08 19:32:31,662 INFO L226 Difference]: Without dead ends: 974 [2025-03-08 19:32:31,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:31,667 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 199 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:31,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1027 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 19:32:31,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-08 19:32:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 959. [2025-03-08 19:32:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 642 states have (on average 1.2850467289719627) internal successors, (825), 655 states have internal predecessors, (825), 236 states have call successors, (236), 81 states have call predecessors, (236), 80 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2025-03-08 19:32:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1296 transitions. [2025-03-08 19:32:31,721 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1296 transitions. Word has length 284 [2025-03-08 19:32:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:31,722 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1296 transitions. [2025-03-08 19:32:31,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-08 19:32:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1296 transitions. [2025-03-08 19:32:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-08 19:32:31,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:31,731 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:31,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:32:31,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:31,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1228857970, now seen corresponding path program 1 times [2025-03-08 19:32:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:31,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532503992] [2025-03-08 19:32:31,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:31,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-08 19:32:31,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-08 19:32:31,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:31,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-08 19:32:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532503992] [2025-03-08 19:32:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532503992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:32,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211381324] [2025-03-08 19:32:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:32,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:32,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:32,172 INFO L87 Difference]: Start difference. First operand 959 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-08 19:32:36,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:36,274 INFO L93 Difference]: Finished difference Result 2524 states and 3432 transitions. [2025-03-08 19:32:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 361 [2025-03-08 19:32:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:36,285 INFO L225 Difference]: With dead ends: 2524 [2025-03-08 19:32:36,285 INFO L226 Difference]: Without dead ends: 1532 [2025-03-08 19:32:36,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:36,289 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 349 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:36,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1132 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:32:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-03-08 19:32:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1526. [2025-03-08 19:32:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1038 states have (on average 1.3121387283236994) internal successors, (1362), 1060 states have internal predecessors, (1362), 361 states have call successors, (361), 127 states have call predecessors, (361), 126 states have return successors, (360), 357 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-08 19:32:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2083 transitions. [2025-03-08 19:32:36,354 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2083 transitions. Word has length 361 [2025-03-08 19:32:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2083 transitions. [2025-03-08 19:32:36,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2025-03-08 19:32:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2083 transitions. [2025-03-08 19:32:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-08 19:32:36,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:36,361 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:36,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:32:36,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:36,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2028432499, now seen corresponding path program 1 times [2025-03-08 19:32:36,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714484587] [2025-03-08 19:32:36,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:36,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-08 19:32:36,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-08 19:32:36,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:36,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-08 19:32:36,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714484587] [2025-03-08 19:32:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714484587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:36,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:36,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:32:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595331570] [2025-03-08 19:32:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:32:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:36,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:32:36,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:36,653 INFO L87 Difference]: Start difference. First operand 1526 states and 2083 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-08 19:32:40,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:40,720 INFO L93 Difference]: Finished difference Result 2377 states and 3214 transitions. [2025-03-08 19:32:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:32:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 361 [2025-03-08 19:32:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:40,725 INFO L225 Difference]: With dead ends: 2377 [2025-03-08 19:32:40,725 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 19:32:40,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:32:40,730 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:40,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 19:32:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 19:32:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-08 19:32:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 579 states have (on average 1.2780656303972366) internal successors, (740), 590 states have internal predecessors, (740), 207 states have call successors, (207), 80 states have call predecessors, (207), 79 states have return successors, (206), 205 states have call predecessors, (206), 206 states have call successors, (206) [2025-03-08 19:32:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1153 transitions. [2025-03-08 19:32:40,760 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1153 transitions. Word has length 361 [2025-03-08 19:32:40,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:40,760 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1153 transitions. [2025-03-08 19:32:40,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 2 states have call successors, (46), 2 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-08 19:32:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1153 transitions. [2025-03-08 19:32:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 19:32:40,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:40,766 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:40,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:32:40,766 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1644182751, now seen corresponding path program 1 times [2025-03-08 19:32:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:40,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039503295] [2025-03-08 19:32:40,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:40,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:40,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 19:32:40,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 19:32:40,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:40,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-08 19:32:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039503295] [2025-03-08 19:32:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039503295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240838300] [2025-03-08 19:32:41,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:41,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:41,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:32:41,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 19:32:41,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 19:32:41,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:41,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:41,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 2179 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:32:41,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:32:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2025-03-08 19:32:42,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:32:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240838300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:32:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-08 19:32:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613401994] [2025-03-08 19:32:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:32:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:42,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:32:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:32:42,136 INFO L87 Difference]: Start difference. First operand 866 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 3 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-08 19:32:46,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:46,602 INFO L93 Difference]: Finished difference Result 2113 states and 2858 transitions. [2025-03-08 19:32:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:32:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 3 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 367 [2025-03-08 19:32:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:46,614 INFO L225 Difference]: With dead ends: 2113 [2025-03-08 19:32:46,614 INFO L226 Difference]: Without dead ends: 1912 [2025-03-08 19:32:46,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 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-08 19:32:46,617 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 702 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:46,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 1523 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 19:32:46,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2025-03-08 19:32:46,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1904. [2025-03-08 19:32:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1302 states have (on average 1.3294930875576036) internal successors, (1731), 1332 states have internal predecessors, (1731), 445 states have call successors, (445), 157 states have call predecessors, (445), 156 states have return successors, (444), 439 states have call predecessors, (444), 444 states have call successors, (444) [2025-03-08 19:32:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2620 transitions. [2025-03-08 19:32:46,706 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2620 transitions. Word has length 367 [2025-03-08 19:32:46,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:46,707 INFO L471 AbstractCegarLoop]: Abstraction has 1904 states and 2620 transitions. [2025-03-08 19:32:46,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 3 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-08 19:32:46,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2620 transitions. [2025-03-08 19:32:46,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-08 19:32:46,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:46,717 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:46,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 19:32:46,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 19:32:46,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:46,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1625292546, now seen corresponding path program 1 times [2025-03-08 19:32:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359739888] [2025-03-08 19:32:46,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:46,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:47,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-08 19:32:47,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-08 19:32:47,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-03-08 19:32:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359739888] [2025-03-08 19:32:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359739888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:47,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:32:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40691771] [2025-03-08 19:32:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:47,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:32:47,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:47,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:32:47,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:32:47,398 INFO L87 Difference]: Start difference. First operand 1904 states and 2620 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 19:32:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:47,537 INFO L93 Difference]: Finished difference Result 5176 states and 7206 transitions. [2025-03-08 19:32:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 19:32:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 367 [2025-03-08 19:32:47,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:47,555 INFO L225 Difference]: With dead ends: 5176 [2025-03-08 19:32:47,555 INFO L226 Difference]: Without dead ends: 3546 [2025-03-08 19:32:47,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:32:47,563 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 526 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:47,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1944 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3546 states. [2025-03-08 19:32:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3546 to 1908. [2025-03-08 19:32:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1306 states have (on average 1.3284839203675345) internal successors, (1735), 1338 states have internal predecessors, (1735), 445 states have call successors, (445), 157 states have call predecessors, (445), 156 states have return successors, (444), 437 states have call predecessors, (444), 444 states have call successors, (444) [2025-03-08 19:32:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2624 transitions. [2025-03-08 19:32:47,656 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2624 transitions. Word has length 367 [2025-03-08 19:32:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:47,658 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2624 transitions. [2025-03-08 19:32:47,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-08 19:32:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2624 transitions. [2025-03-08 19:32:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2025-03-08 19:32:47,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:47,666 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:47,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:32:47,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash -461263721, now seen corresponding path program 1 times [2025-03-08 19:32:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:47,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198797989] [2025-03-08 19:32:47,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:47,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 508 statements into 1 equivalence classes. [2025-03-08 19:32:47,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 508 of 508 statements. [2025-03-08 19:32:47,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:47,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2025-03-08 19:32:48,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:48,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198797989] [2025-03-08 19:32:48,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198797989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:48,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:48,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:32:48,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286467037] [2025-03-08 19:32:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:48,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:32:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:48,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:32:48,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:48,533 INFO L87 Difference]: Start difference. First operand 1908 states and 2624 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-08 19:32:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:48,621 INFO L93 Difference]: Finished difference Result 3700 states and 5104 transitions. [2025-03-08 19:32:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:32:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 2 states have call successors, (49) Word has length 508 [2025-03-08 19:32:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:48,631 INFO L225 Difference]: With dead ends: 3700 [2025-03-08 19:32:48,631 INFO L226 Difference]: Without dead ends: 1911 [2025-03-08 19:32:48,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:48,637 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 0 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:48,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2612 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-08 19:32:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1908. [2025-03-08 19:32:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1306 states have (on average 1.327718223583461) internal successors, (1734), 1338 states have internal predecessors, (1734), 445 states have call successors, (445), 157 states have call predecessors, (445), 156 states have return successors, (444), 437 states have call predecessors, (444), 444 states have call successors, (444) [2025-03-08 19:32:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2623 transitions. [2025-03-08 19:32:48,704 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2623 transitions. Word has length 508 [2025-03-08 19:32:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:48,704 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2623 transitions. [2025-03-08 19:32:48,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (49), 3 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-08 19:32:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2623 transitions. [2025-03-08 19:32:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-08 19:32:48,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:48,712 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 12, 12, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:32:48,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:48,713 INFO L85 PathProgramCache]: Analyzing trace with hash -451294903, now seen corresponding path program 1 times [2025-03-08 19:32:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:48,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749580061] [2025-03-08 19:32:48,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:48,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-08 19:32:49,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-08 19:32:49,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:49,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2025-03-08 19:32:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749580061] [2025-03-08 19:32:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749580061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289098057] [2025-03-08 19:32:49,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:49,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:49,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:49,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:32:50,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-08 19:32:50,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-08 19:32:50,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:50,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:50,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 19:32:50,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:32:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2025-03-08 19:32:50,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:32:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289098057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:50,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:32:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-08 19:32:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111163122] [2025-03-08 19:32:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:32:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:50,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:32:50,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:32:50,319 INFO L87 Difference]: Start difference. First operand 1908 states and 2623 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-08 19:32:54,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:32:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:54,416 INFO L93 Difference]: Finished difference Result 3545 states and 4917 transitions. [2025-03-08 19:32:54,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:32:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 514 [2025-03-08 19:32:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:54,427 INFO L225 Difference]: With dead ends: 3545 [2025-03-08 19:32:54,427 INFO L226 Difference]: Without dead ends: 1899 [2025-03-08 19:32:54,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:32:54,433 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 0 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:54,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2079 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 19:32:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-08 19:32:54,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1899. [2025-03-08 19:32:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1301 states have (on average 1.3282090699461953) internal successors, (1728), 1333 states have internal predecessors, (1728), 442 states have call successors, (442), 156 states have call predecessors, (442), 155 states have return successors, (441), 434 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-08 19:32:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2611 transitions. [2025-03-08 19:32:54,515 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2611 transitions. Word has length 514 [2025-03-08 19:32:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 2611 transitions. [2025-03-08 19:32:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 3 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2025-03-08 19:32:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2611 transitions. [2025-03-08 19:32:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-03-08 19:32:54,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:54,523 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 29, 29, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:54,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 19:32:54,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:54,724 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 157363170, now seen corresponding path program 1 times [2025-03-08 19:32:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323563611] [2025-03-08 19:32:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:54,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:54,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-03-08 19:32:54,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-03-08 19:32:54,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:54,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2025-03-08 19:32:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323563611] [2025-03-08 19:32:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323563611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:32:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:32:55,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064760970] [2025-03-08 19:32:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:32:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:55,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:32:55,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:55,764 INFO L87 Difference]: Start difference. First operand 1899 states and 2611 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 3 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 19:32:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:55,856 INFO L93 Difference]: Finished difference Result 3609 states and 4987 transitions. [2025-03-08 19:32:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:32:55,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 3 states have call predecessors, (72), 2 states have call successors, (72) Word has length 704 [2025-03-08 19:32:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:55,867 INFO L225 Difference]: With dead ends: 3609 [2025-03-08 19:32:55,868 INFO L226 Difference]: Without dead ends: 1899 [2025-03-08 19:32:55,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:55,873 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 0 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:55,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2569 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-03-08 19:32:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1899. [2025-03-08 19:32:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1899 states, 1301 states have (on average 1.3274404304381244) internal successors, (1727), 1333 states have internal predecessors, (1727), 442 states have call successors, (442), 156 states have call predecessors, (442), 155 states have return successors, (441), 434 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-08 19:32:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 2610 transitions. [2025-03-08 19:32:55,939 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 2610 transitions. Word has length 704 [2025-03-08 19:32:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 1899 states and 2610 transitions. [2025-03-08 19:32:55,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (73), 2 states have call predecessors, (73), 2 states have return successors, (72), 3 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-08 19:32:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2610 transitions. [2025-03-08 19:32:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-08 19:32:55,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:55,950 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 29, 29, 20, 20, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:55,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:32:55,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:55,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:55,951 INFO L85 PathProgramCache]: Analyzing trace with hash -979485072, now seen corresponding path program 1 times [2025-03-08 19:32:55,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:55,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576496423] [2025-03-08 19:32:55,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:55,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:56,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 19:32:56,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 19:32:56,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:56,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3550 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3530 trivial. 0 not checked. [2025-03-08 19:32:56,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576496423] [2025-03-08 19:32:56,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576496423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:56,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810571751] [2025-03-08 19:32:56,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:56,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:56,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:56,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 19:32:57,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 19:32:58,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 19:32:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:58,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 3393 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 19:32:58,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:32:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3550 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 3353 trivial. 0 not checked. [2025-03-08 19:32:58,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:32:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810571751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:32:58,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:32:58,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 19:32:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463585686] [2025-03-08 19:32:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:32:58,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:32:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:32:58,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:32:58,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:58,132 INFO L87 Difference]: Start difference. First operand 1899 states and 2610 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 19:32:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:32:58,221 INFO L93 Difference]: Finished difference Result 3780 states and 5203 transitions. [2025-03-08 19:32:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:32:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) Word has length 710 [2025-03-08 19:32:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:32:58,232 INFO L225 Difference]: With dead ends: 3780 [2025-03-08 19:32:58,232 INFO L226 Difference]: Without dead ends: 1900 [2025-03-08 19:32:58,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 709 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:32:58,239 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 0 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:32:58,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1525 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:32:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-03-08 19:32:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2025-03-08 19:32:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1302 states have (on average 1.327188940092166) internal successors, (1728), 1334 states have internal predecessors, (1728), 442 states have call successors, (442), 156 states have call predecessors, (442), 155 states have return successors, (441), 434 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-08 19:32:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2611 transitions. [2025-03-08 19:32:58,302 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2611 transitions. Word has length 710 [2025-03-08 19:32:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:32:58,303 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2611 transitions. [2025-03-08 19:32:58,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 2 states have call successors, (75), 2 states have call predecessors, (75), 3 states have return successors, (74), 2 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-08 19:32:58,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2611 transitions. [2025-03-08 19:32:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2025-03-08 19:32:58,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:32:58,311 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 29, 29, 20, 20, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:32:58,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 19:32:58,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:58,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:32:58,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:32:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash -258722838, now seen corresponding path program 1 times [2025-03-08 19:32:58,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:32:58,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595780447] [2025-03-08 19:32:58,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:58,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:32:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-03-08 19:32:58,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-03-08 19:32:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:32:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:32:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3565 trivial. 0 not checked. [2025-03-08 19:32:59,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:32:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595780447] [2025-03-08 19:32:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595780447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:32:59,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366893730] [2025-03-08 19:32:59,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:32:59,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:32:59,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:32:59,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:32:59,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 19:33:00,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 716 statements into 1 equivalence classes. [2025-03-08 19:33:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 716 of 716 statements. [2025-03-08 19:33:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:33:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:00,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 3483 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 19:33:00,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:33:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 184 proven. 1 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2025-03-08 19:33:00,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:33:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3601 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3565 trivial. 0 not checked. [2025-03-08 19:33:01,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366893730] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:33:01,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:33:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 19:33:01,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197762007] [2025-03-08 19:33:01,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:33:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 19:33:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:33:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 19:33:01,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 19:33:01,672 INFO L87 Difference]: Start difference. First operand 1900 states and 2611 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (140), 2 states have call predecessors, (140), 2 states have call successors, (140) [2025-03-08 19:33:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:33:01,850 INFO L93 Difference]: Finished difference Result 3792 states and 5223 transitions. [2025-03-08 19:33:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 19:33:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (140), 2 states have call predecessors, (140), 2 states have call successors, (140) Word has length 716 [2025-03-08 19:33:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:33:01,892 INFO L225 Difference]: With dead ends: 3792 [2025-03-08 19:33:01,892 INFO L226 Difference]: Without dead ends: 1911 [2025-03-08 19:33:01,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1439 GetRequests, 1427 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-08 19:33:01,897 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 6 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:33:01,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2022 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:33:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-08 19:33:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1910. [2025-03-08 19:33:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1311 states have (on average 1.3272311212814645) internal successors, (1740), 1343 states have internal predecessors, (1740), 442 states have call successors, (442), 157 states have call predecessors, (442), 156 states have return successors, (441), 434 states have call predecessors, (441), 441 states have call successors, (441) [2025-03-08 19:33:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2623 transitions. [2025-03-08 19:33:01,960 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2623 transitions. Word has length 716 [2025-03-08 19:33:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:33:01,960 INFO L471 AbstractCegarLoop]: Abstraction has 1910 states and 2623 transitions. [2025-03-08 19:33:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 2 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (140), 2 states have call predecessors, (140), 2 states have call successors, (140) [2025-03-08 19:33:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2623 transitions. [2025-03-08 19:33:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-08 19:33:01,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:33:01,969 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 29, 29, 20, 20, 20, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:33:01,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 19:33:02,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 19:33:02,170 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:33:02,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:33:02,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1293506096, now seen corresponding path program 2 times [2025-03-08 19:33:02,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:33:02,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891538608] [2025-03-08 19:33:02,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:33:02,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:33:02,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 730 statements into 2 equivalence classes. [2025-03-08 19:33:02,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 730 of 730 statements. [2025-03-08 19:33:02,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 19:33:02,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:33:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3860 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 3730 trivial. 0 not checked. [2025-03-08 19:33:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:33:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891538608] [2025-03-08 19:33:03,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891538608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:33:03,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585061114] [2025-03-08 19:33:03,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:33:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:33:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:33:03,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:33:03,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 19:33:04,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 730 statements into 2 equivalence classes.