./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:19:45,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:19:45,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:19:45,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:19:45,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:19:45,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:19:45,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:19:45,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:19:45,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:19:45,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:19:45,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:19:45,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:19:45,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:19:45,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:19:45,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:19:45,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:19:45,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:19:45,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:19:45,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:19:45,415 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 [2025-02-06 06:19:45,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:19:45,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:19:45,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:19:45,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:19:45,646 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:19:45,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-02-06 06:19:46,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ced8d6f/83141f79b84749c28f413613622ae3df/FLAGa8a3cefa3 [2025-02-06 06:19:47,343 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:19:47,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-02-06 06:19:47,379 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ced8d6f/83141f79b84749c28f413613622ae3df/FLAGa8a3cefa3 [2025-02-06 06:19:47,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87ced8d6f/83141f79b84749c28f413613622ae3df [2025-02-06 06:19:47,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:19:47,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:19:47,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:19:47,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:19:47,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:19:47,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:47" (1/1) ... [2025-02-06 06:19:47,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4c42be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:47, skipping insertion in model container [2025-02-06 06:19:47,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:47" (1/1) ... [2025-02-06 06:19:47,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:19:48,712 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-02-06 06:19:48,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:19:48,783 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:19:48,911 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 %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [6103] [2025-02-06 06:19:48,913 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,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [6111-6112] [2025-02-06 06:19:48,914 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [6119] [2025-02-06 06:19:48,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/exper_fp/inst/current/envs/linux-3.10-rc1.tar/linux-3.10-rc1/arch/x86/include/asm/paravirt.h"), "i" (824), "i" (12UL)); [6179-6180] [2025-02-06 06:19:48,917 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("771:\n\tcall *%c2;\n772:\n.pushsection .parainstructions,\"a\"\n .balign 8 \n .quad 771b\n .byte %c1\n .byte 772b-771b\n .short %c3\n.popsection\n": "=a" (__eax): [paravirt_typenum] "i" (44UL), [paravirt_opptr] "i" (& pv_irq_ops.save_fl.func), [paravirt_clobber] "i" (1): "memory", "cc"); [6185-6187] [2025-02-06 06:19:49,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-02-06 06:19:49,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:19:49,080 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:19:49,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49 WrapperNode [2025-02-06 06:19:49,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:19:49,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:19:49,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:19:49,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:19:49,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,227 INFO L138 Inliner]: procedures = 216, calls = 1507, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3386 [2025-02-06 06:19:49,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:19:49,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:19:49,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:19:49,230 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:19:49,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,698 INFO L175 MemorySlicer]: Split 587 memory accesses to 18 slices as follows [2, 8, 1, 2, 5, 3, 5, 110, 1, 8, 1, 415, 3, 2, 8, 8, 1, 4]. 71 percent of accesses are in the largest equivalence class. The 129 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 110, 0, 8, 1, 0, 0, 0, 0, 8, 0, 0]. The 239 writes are split as follows [0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 231, 2, 0, 2, 0, 0, 2]. [2025-02-06 06:19:49,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:19:49,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:19:49,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:19:49,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:19:49,839 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (1/1) ... [2025-02-06 06:19:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:19:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:19:49,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:19:49,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:19:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-02-06 06:19:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2025-02-06 06:19:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-02-06 06:19:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:19:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-02-06 06:19:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:19:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:19:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-02-06 06:19:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-02-06 06:19:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2025-02-06 06:19:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2025-02-06 06:19:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-02-06 06:19:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-02-06 06:19:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:19:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-02-06 06:19:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-02-06 06:19:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:19:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:19:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:19:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:19:49,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-02-06 06:19:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-02-06 06:19:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-06 06:19:49,899 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-02-06 06:19:49,899 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2025-02-06 06:19:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-02-06 06:19:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-02-06 06:19:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-02-06 06:19:49,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-02-06 06:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-02-06 06:19:49,903 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-02-06 06:19:49,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-02-06 06:19:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-02-06 06:19:49,904 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:19:49,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-02-06 06:19:49,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:19:49,905 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2025-02-06 06:19:49,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-06 06:19:49,908 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:19:49,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:19:49,909 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-02-06 06:19:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-02-06 06:19:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2025-02-06 06:19:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2025-02-06 06:19:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 06:19:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-02-06 06:19:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:19:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:19:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 06:19:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-06 06:19:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:19:49,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:19:50,579 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:19:50,581 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:19:50,837 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6195: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-02-06 06:19:50,926 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9401: havoc #t~nondet880; [2025-02-06 06:19:51,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9397: havoc #t~nondet879; [2025-02-06 06:19:51,053 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc #t~nondet866; [2025-02-06 06:19:51,063 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6257: havoc ~res~0#1.base, ~res~0#1.offset; [2025-02-06 06:19:51,110 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8737-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~3#1; [2025-02-06 06:19:51,469 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9340: havoc #t~nondet869; [2025-02-06 06:19:51,471 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9351: havoc #t~nondet871; [2025-02-06 06:19:51,485 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-02-06 06:19:51,504 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc #t~bitwise1; [2025-02-06 06:19:51,506 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9244: havoc #t~nondet856; [2025-02-06 06:19:51,511 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9264: havoc dev_set_drvdata_#t~nondet859#1; [2025-02-06 06:19:51,525 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ttusb_dec_set_modelFINAL: assume true; [2025-02-06 06:19:51,547 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8716-1: ldv_mutex_lock_interruptible_10_#res#1 := ldv_mutex_lock_interruptible_10_~ldv_func_res~2#1; [2025-02-06 06:19:51,550 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9380: havoc #t~ret877.base, #t~ret877.offset; [2025-02-06 06:19:51,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: havoc #t~mem65.base, #t~mem65.offset; [2025-02-06 06:19:51,566 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9384: havoc #t~nondet878; [2025-02-06 06:19:51,574 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc #t~mem137;havoc #t~bitwise138; [2025-02-06 06:19:51,654 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6642: call ULTIMATE.dealloc(~#actual_len~0#1.base, ~#actual_len~0#1.offset);havoc ~#actual_len~0#1.base, ~#actual_len~0#1.offset; [2025-02-06 06:19:51,655 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8679-1: ldv_mutex_lock_interruptible_6_#res#1 := ldv_mutex_lock_interruptible_6_~ldv_func_res~1#1; [2025-02-06 06:19:52,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6832: call ULTIMATE.dealloc(~#b~1.base, ~#b~1.offset);havoc ~#b~1.base, ~#b~1.offset;call ULTIMATE.dealloc(~#pcr~0.base, ~#pcr~0.offset);havoc ~#pcr~0.base, ~#pcr~0.offset;call ULTIMATE.dealloc(~#audio~0.base, ~#audio~0.offset);havoc ~#audio~0.base, ~#audio~0.offset;call ULTIMATE.dealloc(~#video~0.base, ~#video~0.offset);havoc ~#video~0.base, ~#video~0.offset; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6510: havoc input_allocate_device_#t~ret146#1.base, input_allocate_device_#t~ret146#1.offset; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9289: havoc dvb_net_init_#t~nondet863#1; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7771: call ULTIMATE.dealloc(ttusb_dec_stop_sec_feed_~#b0~3#1.base, ttusb_dec_stop_sec_feed_~#b0~3#1.offset);havoc ttusb_dec_stop_sec_feed_~#b0~3#1.base, ttusb_dec_stop_sec_feed_~#b0~3#1.offset; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc request_firmware_#t~nondet872#1; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9362: havoc strlcat_#t~nondet873#1; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9296: havoc dvb_register_adapter_#t~nondet864#1; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8174: call ULTIMATE.dealloc(ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset);havoc ttusb_dec_init_stb_~#mode~0#1.base, ttusb_dec_init_stb_~#mode~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset);havoc ttusb_dec_init_stb_~#model~0#1.base, ttusb_dec_init_stb_~#model~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset);havoc ttusb_dec_init_stb_~#version~0#1.base, ttusb_dec_init_stb_~#version~0#1.offset; [2025-02-06 06:20:01,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7514: call ULTIMATE.dealloc(ttusb_dec_start_ts_feed_~#b0~0#1.base, ttusb_dec_start_ts_feed_~#b0~0#1.offset);havoc ttusb_dec_start_ts_feed_~#b0~0#1.base, ttusb_dec_start_ts_feed_~#b0~0#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9300: havoc dvb_register_frontend_#t~nondet865#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9371: havoc ttusbdecfe_dvbs_attach_#t~ret874#1.base, ttusbdecfe_dvbs_attach_#t~ret874#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9308: havoc dvb_unregister_frontend_#t~nondet867#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9374: havoc ttusbdecfe_dvbt_attach_#t~ret875#1.base, ttusbdecfe_dvbt_attach_#t~ret875#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9377: havoc usb_alloc_coherent_#t~ret876#1.base, usb_alloc_coherent_#t~ret876#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8387: call ULTIMATE.dealloc(ttusb_dec_init_filters_~#__key~2#1.base, ttusb_dec_init_filters_~#__key~2#1.offset);havoc ttusb_dec_init_filters_~#__key~2#1.base, ttusb_dec_init_filters_~#__key~2#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc crc32_le_#t~nondet857#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9318: havoc input_register_device_#t~nondet868#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7999: call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#actual_len~1#1.base, ttusb_dec_boot_dsp_~#actual_len~1#1.offset);havoc ttusb_dec_boot_dsp_~#actual_len~1#1.base, ttusb_dec_boot_dsp_~#actual_len~1#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#b0~4#1.base, ttusb_dec_boot_dsp_~#b0~4#1.offset);havoc ttusb_dec_boot_dsp_~#b0~4#1.base, ttusb_dec_boot_dsp_~#b0~4#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#b1~0#1.base, ttusb_dec_boot_dsp_~#b1~0#1.offset);havoc ttusb_dec_boot_dsp_~#b1~0#1.base, ttusb_dec_boot_dsp_~#b1~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#idstring~0#1.base, ttusb_dec_boot_dsp_~#idstring~0#1.offset);havoc ttusb_dec_boot_dsp_~#idstring~0#1.base, ttusb_dec_boot_dsp_~#idstring~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#firmware_csum_ns~0#1.base, ttusb_dec_boot_dsp_~#firmware_csum_ns~0#1.offset);havoc ttusb_dec_boot_dsp_~#firmware_csum_ns~0#1.base, ttusb_dec_boot_dsp_~#firmware_csum_ns~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#firmware_size_nl~0#1.base, ttusb_dec_boot_dsp_~#firmware_size_nl~0#1.offset);havoc ttusb_dec_boot_dsp_~#firmware_size_nl~0#1.base, ttusb_dec_boot_dsp_~#firmware_size_nl~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#tmp~28#1.base, ttusb_dec_boot_dsp_~#tmp~28#1.offset);havoc ttusb_dec_boot_dsp_~#tmp~28#1.base, ttusb_dec_boot_dsp_~#tmp~28#1.offset;call ULTIMATE.dealloc(ttusb_dec_boot_dsp_~#fw_entry~0#1.base, ttusb_dec_boot_dsp_~#fw_entry~0#1.offset);havoc ttusb_dec_boot_dsp_~#fw_entry~0#1.base, ttusb_dec_boot_dsp_~#fw_entry~0#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6745: call ULTIMATE.dealloc(ttusb_dec_get_stb_state_~#c~0#1.base, ttusb_dec_get_stb_state_~#c~0#1.offset);havoc ttusb_dec_get_stb_state_~#c~0#1.base, ttusb_dec_get_stb_state_~#c~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_get_stb_state_~#c_length~0#1.base, ttusb_dec_get_stb_state_~#c_length~0#1.offset);havoc ttusb_dec_get_stb_state_~#c_length~0#1.base, ttusb_dec_get_stb_state_~#c_length~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_get_stb_state_~#tmp~12#1.base, ttusb_dec_get_stb_state_~#tmp~12#1.offset);havoc ttusb_dec_get_stb_state_~#tmp~12#1.base, ttusb_dec_get_stb_state_~#tmp~12#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260: havoc dev_get_drvdata_#t~ret858#1.base, dev_get_drvdata_#t~ret858#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7875: call ULTIMATE.dealloc(ttusb_dec_init_tasklet_~#__key~0#1.base, ttusb_dec_init_tasklet_~#__key~0#1.offset);havoc ttusb_dec_init_tasklet_~#__key~0#1.base, ttusb_dec_init_tasklet_~#__key~0#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6290: havoc is_device_dma_capable_#t~mem50#1.base, is_device_dma_capable_#t~mem50#1.offset;havoc is_device_dma_capable_#t~mem51#1.base, is_device_dma_capable_#t~mem51#1.offset;havoc is_device_dma_capable_#t~mem52#1;havoc is_device_dma_capable_#t~short53#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9268: havoc dvb_dmx_init_#t~nondet860#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7617: call ULTIMATE.dealloc(ttusb_dec_start_sec_feed_~#b0~1#1.base, ttusb_dec_start_sec_feed_~#b0~1#1.offset);havoc ttusb_dec_start_sec_feed_~#b0~1#1.base, ttusb_dec_start_sec_feed_~#b0~1#1.offset;call ULTIMATE.dealloc(ttusb_dec_start_sec_feed_~#pid~0#1.base, ttusb_dec_start_sec_feed_~#pid~0#1.offset);havoc ttusb_dec_start_sec_feed_~#pid~0#1.base, ttusb_dec_start_sec_feed_~#pid~0#1.offset;call ULTIMATE.dealloc(ttusb_dec_start_sec_feed_~#c~2#1.base, ttusb_dec_start_sec_feed_~#c~2#1.offset);havoc ttusb_dec_start_sec_feed_~#c~2#1.base, ttusb_dec_start_sec_feed_~#c~2#1.offset;call ULTIMATE.dealloc(ttusb_dec_start_sec_feed_~#c_length~1#1.base, ttusb_dec_start_sec_feed_~#c_length~1#1.offset);havoc ttusb_dec_start_sec_feed_~#c_length~1#1.base, ttusb_dec_start_sec_feed_~#c_length~1#1.offset;call ULTIMATE.dealloc(ttusb_dec_start_sec_feed_~#x~0#1.base, ttusb_dec_start_sec_feed_~#x~0#1.offset);havoc ttusb_dec_start_sec_feed_~#x~0#1.base, ttusb_dec_start_sec_feed_~#x~0#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7950: call ULTIMATE.dealloc(ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset);havoc ttusb_dec_init_usb_~#__key~1#1.base, ttusb_dec_init_usb_~#__key~1#1.offset;call ULTIMATE.dealloc(ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset);havoc ttusb_dec_init_usb_~#__key___0~0#1.base, ttusb_dec_init_usb_~#__key___0~0#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc dvb_dmxdev_init_#t~nondet861#1; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7425: call ULTIMATE.dealloc(ttusb_dec_set_interface_~#b~3#1.base, ttusb_dec_set_interface_~#b~3#1.offset);havoc ttusb_dec_set_interface_~#b~3#1.base, ttusb_dec_set_interface_~#b~3#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7888: call ULTIMATE.dealloc(ttusb_init_rc_~#b~4#1.base, ttusb_init_rc_~#b~4#1.offset);havoc ttusb_init_rc_~#b~4#1.base, ttusb_init_rc_~#b~4#1.offset; [2025-02-06 06:20:01,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7758: call ULTIMATE.dealloc(ttusb_dec_stop_ts_feed_~#b0~2#1.base, ttusb_dec_stop_ts_feed_~#b0~2#1.offset);havoc ttusb_dec_stop_ts_feed_~#b0~2#1.base, ttusb_dec_stop_ts_feed_~#b0~2#1.offset; [2025-02-06 06:20:02,184 INFO L? ?]: Removed 1615 outVars from TransFormulas that were not future-live. [2025-02-06 06:20:02,184 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:20:02,258 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:20:02,258 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 06:20:02,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:20:02 BoogieIcfgContainer [2025-02-06 06:20:02,259 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:20:02,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:20:02,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:20:02,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:20:02,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:19:47" (1/3) ... [2025-02-06 06:20:02,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300dd782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:20:02, skipping insertion in model container [2025-02-06 06:20:02,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:49" (2/3) ... [2025-02-06 06:20:02,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300dd782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:20:02, skipping insertion in model container [2025-02-06 06:20:02,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:20:02" (3/3) ... [2025-02-06 06:20:02,286 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i [2025-02-06 06:20:02,299 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:20:02,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i that has 69 procedures, 1229 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-02-06 06:20:02,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:20:02,382 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;@56f13be8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:20:02,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:20:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 1143 states, 819 states have (on average 1.3162393162393162) internal successors, (1078), 839 states have internal predecessors, (1078), 271 states have call successors, (271), 51 states have call predecessors, (271), 50 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2025-02-06 06:20:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 06:20:02,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:02,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:02,393 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 202142642, now seen corresponding path program 1 times [2025-02-06 06:20:02,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115182289] [2025-02-06 06:20:02,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:02,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 06:20:02,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 06:20:02,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:02,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:20:03,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:03,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115182289] [2025-02-06 06:20:03,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115182289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:03,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:03,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:03,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748656479] [2025-02-06 06:20:03,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:03,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:03,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:03,056 INFO L87 Difference]: Start difference. First operand has 1143 states, 819 states have (on average 1.3162393162393162) internal successors, (1078), 839 states have internal predecessors, (1078), 271 states have call successors, (271), 51 states have call predecessors, (271), 50 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:05,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:20:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:05,686 INFO L93 Difference]: Finished difference Result 3396 states and 4894 transitions. [2025-02-06 06:20:05,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 06:20:05,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:05,716 INFO L225 Difference]: With dead ends: 3396 [2025-02-06 06:20:05,716 INFO L226 Difference]: Without dead ends: 2226 [2025-02-06 06:20:05,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:05,733 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 1590 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:05,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 3212 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-06 06:20:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2025-02-06 06:20:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2221. [2025-02-06 06:20:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2221 states, 1604 states have (on average 1.2955112219451372) internal successors, (2078), 1623 states have internal predecessors, (2078), 519 states have call successors, (519), 99 states have call predecessors, (519), 97 states have return successors, (520), 504 states have call predecessors, (520), 508 states have call successors, (520) [2025-02-06 06:20:05,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3117 transitions. [2025-02-06 06:20:05,923 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3117 transitions. Word has length 9 [2025-02-06 06:20:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:05,924 INFO L471 AbstractCegarLoop]: Abstraction has 2221 states and 3117 transitions. [2025-02-06 06:20:05,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3117 transitions. [2025-02-06 06:20:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 06:20:05,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:05,925 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:20:05,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:05,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1970239440, now seen corresponding path program 1 times [2025-02-06 06:20:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653253167] [2025-02-06 06:20:05,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:06,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 06:20:06,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 06:20:06,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:06,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:20:06,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:06,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653253167] [2025-02-06 06:20:06,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653253167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:06,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:06,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:06,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796874214] [2025-02-06 06:20:06,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:06,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:06,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:06,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:06,355 INFO L87 Difference]: Start difference. First operand 2221 states and 3117 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:10,369 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-02-06 06:20:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:10,491 INFO L93 Difference]: Finished difference Result 2223 states and 3118 transitions. [2025-02-06 06:20:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 06:20:10,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:10,508 INFO L225 Difference]: With dead ends: 2223 [2025-02-06 06:20:10,508 INFO L226 Difference]: Without dead ends: 2220 [2025-02-06 06:20:10,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:10,511 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 1562 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:10,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 1552 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-02-06 06:20:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-02-06 06:20:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2220. [2025-02-06 06:20:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2220 states, 1604 states have (on average 1.2948877805486285) internal successors, (2077), 1622 states have internal predecessors, (2077), 518 states have call successors, (518), 99 states have call predecessors, (518), 97 states have return successors, (520), 504 states have call predecessors, (520), 508 states have call successors, (520) [2025-02-06 06:20:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 3115 transitions. [2025-02-06 06:20:10,645 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 3115 transitions. Word has length 10 [2025-02-06 06:20:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:10,645 INFO L471 AbstractCegarLoop]: Abstraction has 2220 states and 3115 transitions. [2025-02-06 06:20:10,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3115 transitions. [2025-02-06 06:20:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 06:20:10,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:10,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:10,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:20:10,646 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:10,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 946664307, now seen corresponding path program 1 times [2025-02-06 06:20:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018036314] [2025-02-06 06:20:10,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:10,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 06:20:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 06:20:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:10,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:20:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018036314] [2025-02-06 06:20:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018036314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:10,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:10,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713030246] [2025-02-06 06:20:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:10,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:10,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:10,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:10,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:10,894 INFO L87 Difference]: Start difference. First operand 2220 states and 3115 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:13,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:20:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:13,225 INFO L93 Difference]: Finished difference Result 2222 states and 3116 transitions. [2025-02-06 06:20:13,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:13,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 06:20:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:13,236 INFO L225 Difference]: With dead ends: 2222 [2025-02-06 06:20:13,236 INFO L226 Difference]: Without dead ends: 2219 [2025-02-06 06:20:13,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:13,238 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 1559 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:13,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 1550 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 06:20:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2025-02-06 06:20:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 2219. [2025-02-06 06:20:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1604 states have (on average 1.2942643391521198) internal successors, (2076), 1621 states have internal predecessors, (2076), 517 states have call successors, (517), 99 states have call predecessors, (517), 97 states have return successors, (520), 504 states have call predecessors, (520), 508 states have call successors, (520) [2025-02-06 06:20:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3113 transitions. [2025-02-06 06:20:13,360 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3113 transitions. Word has length 11 [2025-02-06 06:20:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 2219 states and 3113 transitions. [2025-02-06 06:20:13,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3113 transitions. [2025-02-06 06:20:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 06:20:13,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:13,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:13,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:20:13,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:13,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash -719394767, now seen corresponding path program 1 times [2025-02-06 06:20:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772453200] [2025-02-06 06:20:13,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:13,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 06:20:13,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 06:20:13,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:13,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 06:20:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772453200] [2025-02-06 06:20:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772453200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884604854] [2025-02-06 06:20:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:13,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:13,566 INFO L87 Difference]: Start difference. First operand 2219 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:16,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:20:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:16,680 INFO L93 Difference]: Finished difference Result 6612 states and 9387 transitions. [2025-02-06 06:20:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 06:20:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:16,703 INFO L225 Difference]: With dead ends: 6612 [2025-02-06 06:20:16,703 INFO L226 Difference]: Without dead ends: 4391 [2025-02-06 06:20:16,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:16,715 INFO L435 NwaCegarLoop]: 1607 mSDtfsCounter, 1564 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:16,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 3125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-06 06:20:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4391 states. [2025-02-06 06:20:16,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4391 to 4369. [2025-02-06 06:20:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4369 states, 3167 states have (on average 1.2952320808335964) internal successors, (4102), 3199 states have internal predecessors, (4102), 1010 states have call successors, (1010), 194 states have call predecessors, (1010), 191 states have return successors, (1074), 987 states have call predecessors, (1074), 998 states have call successors, (1074) [2025-02-06 06:20:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4369 states to 4369 states and 6186 transitions. [2025-02-06 06:20:16,930 INFO L78 Accepts]: Start accepts. Automaton has 4369 states and 6186 transitions. Word has length 12 [2025-02-06 06:20:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:16,930 INFO L471 AbstractCegarLoop]: Abstraction has 4369 states and 6186 transitions. [2025-02-06 06:20:16,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 06:20:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4369 states and 6186 transitions. [2025-02-06 06:20:16,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 06:20:16,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:16,944 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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-02-06 06:20:16,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:20:16,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:16,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2097492222, now seen corresponding path program 1 times [2025-02-06 06:20:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636782490] [2025-02-06 06:20:16,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:17,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 06:20:17,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 06:20:17,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:17,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 06:20:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636782490] [2025-02-06 06:20:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636782490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:17,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:17,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:17,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240502557] [2025-02-06 06:20:17,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:17,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:17,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:17,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:17,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:17,484 INFO L87 Difference]: Start difference. First operand 4369 states and 6186 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:20:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:17,664 INFO L93 Difference]: Finished difference Result 8782 states and 12440 transitions. [2025-02-06 06:20:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-02-06 06:20:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:17,688 INFO L225 Difference]: With dead ends: 8782 [2025-02-06 06:20:17,688 INFO L226 Difference]: Without dead ends: 4416 [2025-02-06 06:20:17,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:17,707 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 424 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:17,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2593 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4416 states. [2025-02-06 06:20:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4416 to 4405. [2025-02-06 06:20:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4405 states, 3203 states have (on average 1.2965969403684046) internal successors, (4153), 3235 states have internal predecessors, (4153), 1010 states have call successors, (1010), 194 states have call predecessors, (1010), 191 states have return successors, (1074), 987 states have call predecessors, (1074), 998 states have call successors, (1074) [2025-02-06 06:20:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4405 states to 4405 states and 6237 transitions. [2025-02-06 06:20:17,910 INFO L78 Accepts]: Start accepts. Automaton has 4405 states and 6237 transitions. Word has length 138 [2025-02-06 06:20:17,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:17,910 INFO L471 AbstractCegarLoop]: Abstraction has 4405 states and 6237 transitions. [2025-02-06 06:20:17,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:20:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4405 states and 6237 transitions. [2025-02-06 06:20:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 06:20:17,914 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:17,914 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 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] [2025-02-06 06:20:17,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:20:17,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:17,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -333994969, now seen corresponding path program 1 times [2025-02-06 06:20:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:17,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178984938] [2025-02-06 06:20:17,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:17,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:18,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 06:20:18,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 06:20:18,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-06 06:20:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:18,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178984938] [2025-02-06 06:20:18,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178984938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:18,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:18,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:18,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278541308] [2025-02-06 06:20:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:18,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:18,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:18,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:18,401 INFO L87 Difference]: Start difference. First operand 4405 states and 6237 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 06:20:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:18,607 INFO L93 Difference]: Finished difference Result 8587 states and 12151 transitions. [2025-02-06 06:20:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-02-06 06:20:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:18,631 INFO L225 Difference]: With dead ends: 8587 [2025-02-06 06:20:18,631 INFO L226 Difference]: Without dead ends: 4185 [2025-02-06 06:20:18,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:18,649 INFO L435 NwaCegarLoop]: 1468 mSDtfsCounter, 1444 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:18,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 1468 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2025-02-06 06:20:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 4185. [2025-02-06 06:20:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 3023 states have (on average 1.2917631491895467) internal successors, (3905), 3055 states have internal predecessors, (3905), 970 states have call successors, (970), 194 states have call predecessors, (970), 191 states have return successors, (1030), 947 states have call predecessors, (1030), 958 states have call successors, (1030) [2025-02-06 06:20:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5905 transitions. [2025-02-06 06:20:18,875 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5905 transitions. Word has length 156 [2025-02-06 06:20:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:18,875 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 5905 transitions. [2025-02-06 06:20:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-02-06 06:20:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5905 transitions. [2025-02-06 06:20:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 06:20:18,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:18,882 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-02-06 06:20:18,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:20:18,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:18,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:18,883 INFO L85 PathProgramCache]: Analyzing trace with hash -875364392, now seen corresponding path program 1 times [2025-02-06 06:20:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:18,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502897962] [2025-02-06 06:20:18,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:19,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 06:20:19,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 06:20:19,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:19,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-06 06:20:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502897962] [2025-02-06 06:20:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502897962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:19,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:19,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 06:20:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941695679] [2025-02-06 06:20:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:19,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:20:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:19,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:20:19,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 06:20:19,234 INFO L87 Difference]: Start difference. First operand 4185 states and 5905 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:20:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:19,453 INFO L93 Difference]: Finished difference Result 8383 states and 11826 transitions. [2025-02-06 06:20:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:20:19,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-02-06 06:20:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:19,482 INFO L225 Difference]: With dead ends: 8383 [2025-02-06 06:20:19,486 INFO L226 Difference]: Without dead ends: 4195 [2025-02-06 06:20:19,518 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-02-06 06:20:19,518 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 0 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:19,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4399 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2025-02-06 06:20:19,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 4195. [2025-02-06 06:20:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4195 states, 3034 states have (on average 1.2903757415952537) internal successors, (3915), 3066 states have internal predecessors, (3915), 969 states have call successors, (969), 194 states have call predecessors, (969), 191 states have return successors, (1029), 946 states have call predecessors, (1029), 957 states have call successors, (1029) [2025-02-06 06:20:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4195 states to 4195 states and 5913 transitions. [2025-02-06 06:20:19,827 INFO L78 Accepts]: Start accepts. Automaton has 4195 states and 5913 transitions. Word has length 174 [2025-02-06 06:20:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:19,827 INFO L471 AbstractCegarLoop]: Abstraction has 4195 states and 5913 transitions. [2025-02-06 06:20:19,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:20:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4195 states and 5913 transitions. [2025-02-06 06:20:19,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-06 06:20:19,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:19,831 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2025-02-06 06:20:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:20:19,831 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:19,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash 107848569, now seen corresponding path program 1 times [2025-02-06 06:20:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:19,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962476175] [2025-02-06 06:20:19,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:19,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:19,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 06:20:20,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 06:20:20,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:20,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 06:20:20,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962476175] [2025-02-06 06:20:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962476175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:20:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755487877] [2025-02-06 06:20:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:20,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:20:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:20,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:20:20,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:20,456 INFO L87 Difference]: Start difference. First operand 4195 states and 5913 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:20:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:20,738 INFO L93 Difference]: Finished difference Result 8399 states and 11839 transitions. [2025-02-06 06:20:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:20:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 171 [2025-02-06 06:20:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:20,776 INFO L225 Difference]: With dead ends: 8399 [2025-02-06 06:20:20,776 INFO L226 Difference]: Without dead ends: 4207 [2025-02-06 06:20:20,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:20,793 INFO L435 NwaCegarLoop]: 1468 mSDtfsCounter, 0 mSDsluCounter, 4396 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5864 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:20,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5864 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-02-06 06:20:20,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 4207. [2025-02-06 06:20:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 3046 states have (on average 1.2892317793827972) internal successors, (3927), 3078 states have internal predecessors, (3927), 969 states have call successors, (969), 194 states have call predecessors, (969), 191 states have return successors, (1029), 946 states have call predecessors, (1029), 957 states have call successors, (1029) [2025-02-06 06:20:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 5925 transitions. [2025-02-06 06:20:20,976 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 5925 transitions. Word has length 171 [2025-02-06 06:20:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:20,977 INFO L471 AbstractCegarLoop]: Abstraction has 4207 states and 5925 transitions. [2025-02-06 06:20:20,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-02-06 06:20:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 5925 transitions. [2025-02-06 06:20:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 06:20:20,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:20,980 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 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] [2025-02-06 06:20:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:20:20,980 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:20,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -946110089, now seen corresponding path program 1 times [2025-02-06 06:20:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860940297] [2025-02-06 06:20:20,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:20,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:21,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 06:20:21,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 06:20:21,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:21,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-02-06 06:20:21,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:21,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860940297] [2025-02-06 06:20:21,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860940297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:21,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:21,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:21,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247180520] [2025-02-06 06:20:21,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:21,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:21,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:21,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:21,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:21,485 INFO L87 Difference]: Start difference. First operand 4207 states and 5925 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:20:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:21,638 INFO L93 Difference]: Finished difference Result 8439 states and 11891 transitions. [2025-02-06 06:20:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2025-02-06 06:20:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:21,655 INFO L225 Difference]: With dead ends: 8439 [2025-02-06 06:20:21,655 INFO L226 Difference]: Without dead ends: 4235 [2025-02-06 06:20:21,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:21,666 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 4 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:21,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2935 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2025-02-06 06:20:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4211. [2025-02-06 06:20:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 3050 states have (on average 1.2888524590163934) internal successors, (3931), 3082 states have internal predecessors, (3931), 969 states have call successors, (969), 194 states have call predecessors, (969), 191 states have return successors, (1029), 946 states have call predecessors, (1029), 957 states have call successors, (1029) [2025-02-06 06:20:21,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5929 transitions. [2025-02-06 06:20:21,868 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5929 transitions. Word has length 180 [2025-02-06 06:20:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:21,869 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 5929 transitions. [2025-02-06 06:20:21,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 06:20:21,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5929 transitions. [2025-02-06 06:20:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 06:20:21,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:21,872 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 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] [2025-02-06 06:20:21,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:20:21,872 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -252602460, now seen corresponding path program 1 times [2025-02-06 06:20:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026614492] [2025-02-06 06:20:21,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:22,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 06:20:22,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 06:20:22,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:22,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-06 06:20:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026614492] [2025-02-06 06:20:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026614492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977023952] [2025-02-06 06:20:22,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:22,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:22,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:20:23,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 06:20:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 06:20:23,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:23,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:23,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:20:23,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-06 06:20:23,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:20:23,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977023952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:20:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 06:20:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088891036] [2025-02-06 06:20:23,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:23,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:23,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:23,436 INFO L87 Difference]: Start difference. First operand 4211 states and 5929 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 06:20:23,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:23,872 INFO L93 Difference]: Finished difference Result 8435 states and 11895 transitions. [2025-02-06 06:20:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:23,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 193 [2025-02-06 06:20:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:23,888 INFO L225 Difference]: With dead ends: 8435 [2025-02-06 06:20:23,888 INFO L226 Difference]: Without dead ends: 4227 [2025-02-06 06:20:23,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:23,898 INFO L435 NwaCegarLoop]: 1468 mSDtfsCounter, 4 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:23,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2933 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:20:23,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2025-02-06 06:20:24,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4215. [2025-02-06 06:20:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4215 states, 3054 states have (on average 1.288474132285527) internal successors, (3935), 3086 states have internal predecessors, (3935), 969 states have call successors, (969), 194 states have call predecessors, (969), 191 states have return successors, (1029), 946 states have call predecessors, (1029), 957 states have call successors, (1029) [2025-02-06 06:20:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 5933 transitions. [2025-02-06 06:20:24,072 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 5933 transitions. Word has length 193 [2025-02-06 06:20:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 4215 states and 5933 transitions. [2025-02-06 06:20:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 06:20:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 5933 transitions. [2025-02-06 06:20:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 06:20:24,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:24,076 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 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] [2025-02-06 06:20:24,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 06:20:24,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 06:20:24,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:24,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1597054548, now seen corresponding path program 1 times [2025-02-06 06:20:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:24,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794370433] [2025-02-06 06:20:24,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:24,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 06:20:24,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 06:20:24,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:24,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-02-06 06:20:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794370433] [2025-02-06 06:20:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794370433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715546974] [2025-02-06 06:20:24,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:24,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:24,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:24,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:24,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:20:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 06:20:25,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 06:20:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:25,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:20:25,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:25,591 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-06 06:20:25,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:20:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715546974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:20:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 06:20:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962189092] [2025-02-06 06:20:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:25,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:25,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:25,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:25,597 INFO L87 Difference]: Start difference. First operand 4215 states and 5933 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 06:20:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:25,796 INFO L93 Difference]: Finished difference Result 8435 states and 11891 transitions. [2025-02-06 06:20:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:25,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 196 [2025-02-06 06:20:25,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:25,814 INFO L225 Difference]: With dead ends: 8435 [2025-02-06 06:20:25,814 INFO L226 Difference]: Without dead ends: 4223 [2025-02-06 06:20:25,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:25,825 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 1 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:25,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2935 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-06 06:20:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 4219. [2025-02-06 06:20:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4219 states, 3058 states have (on average 1.2880967952910398) internal successors, (3939), 3090 states have internal predecessors, (3939), 969 states have call successors, (969), 194 states have call predecessors, (969), 191 states have return successors, (1029), 946 states have call predecessors, (1029), 957 states have call successors, (1029) [2025-02-06 06:20:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 5937 transitions. [2025-02-06 06:20:26,044 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 5937 transitions. Word has length 196 [2025-02-06 06:20:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 4219 states and 5937 transitions. [2025-02-06 06:20:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-02-06 06:20:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 5937 transitions. [2025-02-06 06:20:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-06 06:20:26,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:26,047 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 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] [2025-02-06 06:20:26,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:20:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:26,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 594863977, now seen corresponding path program 1 times [2025-02-06 06:20:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299137959] [2025-02-06 06:20:26,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:26,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:26,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 06:20:26,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 06:20:26,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:26,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 06:20:26,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299137959] [2025-02-06 06:20:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299137959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:26,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954861346] [2025-02-06 06:20:26,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:26,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:26,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:26,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:20:27,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 06:20:27,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 06:20:27,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:27,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:27,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:27,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-02-06 06:20:27,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:20:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-02-06 06:20:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954861346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:20:27,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:20:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:20:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095349327] [2025-02-06 06:20:27,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:20:27,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:20:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:27,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:20:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:27,760 INFO L87 Difference]: Start difference. First operand 4219 states and 5937 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 06:20:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:28,162 INFO L93 Difference]: Finished difference Result 8523 states and 12007 transitions. [2025-02-06 06:20:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 198 [2025-02-06 06:20:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:28,222 INFO L225 Difference]: With dead ends: 8523 [2025-02-06 06:20:28,222 INFO L226 Difference]: Without dead ends: 4307 [2025-02-06 06:20:28,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:28,280 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 18 mSDsluCounter, 4392 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5862 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:28,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5862 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:20:28,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4307 states. [2025-02-06 06:20:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4307 to 4267. [2025-02-06 06:20:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3094 states have (on average 1.2886231415643181) internal successors, (3987), 3126 states have internal predecessors, (3987), 981 states have call successors, (981), 194 states have call predecessors, (981), 191 states have return successors, (1041), 958 states have call predecessors, (1041), 969 states have call successors, (1041) [2025-02-06 06:20:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6009 transitions. [2025-02-06 06:20:28,458 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6009 transitions. Word has length 198 [2025-02-06 06:20:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:28,458 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 6009 transitions. [2025-02-06 06:20:28,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-02-06 06:20:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6009 transitions. [2025-02-06 06:20:28,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-06 06:20:28,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:28,461 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:20:28,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:20:28,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:28,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:28,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash -271165642, now seen corresponding path program 2 times [2025-02-06 06:20:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009332871] [2025-02-06 06:20:28,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:20:28,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:28,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-02-06 06:20:28,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 237 statements. [2025-02-06 06:20:28,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:20:28,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 06:20:28,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009332871] [2025-02-06 06:20:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009332871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118783693] [2025-02-06 06:20:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:28,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:28,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:28,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:28,969 INFO L87 Difference]: Start difference. First operand 4267 states and 6009 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:20:30,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:20:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:30,699 INFO L93 Difference]: Finished difference Result 8543 states and 12050 transitions. [2025-02-06 06:20:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 237 [2025-02-06 06:20:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:30,723 INFO L225 Difference]: With dead ends: 8543 [2025-02-06 06:20:30,723 INFO L226 Difference]: Without dead ends: 4279 [2025-02-06 06:20:30,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:30,737 INFO L435 NwaCegarLoop]: 2852 mSDtfsCounter, 1443 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 4309 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:30,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 4309 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 06:20:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2025-02-06 06:20:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4265. [2025-02-06 06:20:30,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4265 states, 3092 states have (on average 1.28751617076326) internal successors, (3981), 3125 states have internal predecessors, (3981), 981 states have call successors, (981), 194 states have call predecessors, (981), 191 states have return successors, (1017), 957 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-02-06 06:20:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4265 states to 4265 states and 5979 transitions. [2025-02-06 06:20:30,933 INFO L78 Accepts]: Start accepts. Automaton has 4265 states and 5979 transitions. Word has length 237 [2025-02-06 06:20:30,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:30,933 INFO L471 AbstractCegarLoop]: Abstraction has 4265 states and 5979 transitions. [2025-02-06 06:20:30,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:20:30,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4265 states and 5979 transitions. [2025-02-06 06:20:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-06 06:20:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:30,938 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:20:30,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:20:30,938 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:30,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2076603976, now seen corresponding path program 1 times [2025-02-06 06:20:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:30,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978200603] [2025-02-06 06:20:30,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:31,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-06 06:20:31,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 06:20:31,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:31,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-06 06:20:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978200603] [2025-02-06 06:20:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978200603] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008512503] [2025-02-06 06:20:31,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:31,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:31,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:31,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:31,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 06:20:32,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-06 06:20:32,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-06 06:20:32,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:32,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:32,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 2810 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:32,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-02-06 06:20:32,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:20:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-06 06:20:32,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008512503] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:20:32,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:20:32,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:20:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576651934] [2025-02-06 06:20:32,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:20:32,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:20:32,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:32,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:20:32,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:32,563 INFO L87 Difference]: Start difference. First operand 4265 states and 5979 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:20:32,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:32,741 INFO L93 Difference]: Finished difference Result 8551 states and 12007 transitions. [2025-02-06 06:20:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:32,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 237 [2025-02-06 06:20:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:32,758 INFO L225 Difference]: With dead ends: 8551 [2025-02-06 06:20:32,758 INFO L226 Difference]: Without dead ends: 4289 [2025-02-06 06:20:32,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:32,765 INFO L435 NwaCegarLoop]: 1469 mSDtfsCounter, 2 mSDsluCounter, 2932 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:32,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4401 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:32,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4289 states. [2025-02-06 06:20:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4289 to 4289. [2025-02-06 06:20:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4289 states, 3116 states have (on average 1.2853016688061618) internal successors, (4005), 3149 states have internal predecessors, (4005), 981 states have call successors, (981), 194 states have call predecessors, (981), 191 states have return successors, (1017), 957 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-02-06 06:20:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4289 states to 4289 states and 6003 transitions. [2025-02-06 06:20:32,882 INFO L78 Accepts]: Start accepts. Automaton has 4289 states and 6003 transitions. Word has length 237 [2025-02-06 06:20:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:32,884 INFO L471 AbstractCegarLoop]: Abstraction has 4289 states and 6003 transitions. [2025-02-06 06:20:32,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:20:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4289 states and 6003 transitions. [2025-02-06 06:20:32,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-02-06 06:20:32,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:32,888 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-02-06 06:20:32,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 06:20:33,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 06:20:33,089 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:33,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1534187089, now seen corresponding path program 2 times [2025-02-06 06:20:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:33,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658075619] [2025-02-06 06:20:33,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:20:33,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:33,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-02-06 06:20:33,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 243 statements. [2025-02-06 06:20:33,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:20:33,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-02-06 06:20:33,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:33,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658075619] [2025-02-06 06:20:33,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658075619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:33,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:33,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:20:33,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162363331] [2025-02-06 06:20:33,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:33,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:20:33,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:20:33,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:33,468 INFO L87 Difference]: Start difference. First operand 4289 states and 6003 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:20:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:33,643 INFO L93 Difference]: Finished difference Result 4313 states and 6024 transitions. [2025-02-06 06:20:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:20:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 243 [2025-02-06 06:20:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:33,661 INFO L225 Difference]: With dead ends: 4313 [2025-02-06 06:20:33,661 INFO L226 Difference]: Without dead ends: 4207 [2025-02-06 06:20:33,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:33,664 INFO L435 NwaCegarLoop]: 1473 mSDtfsCounter, 1 mSDsluCounter, 4397 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:33,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5870 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2025-02-06 06:20:33,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 4207. [2025-02-06 06:20:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 3062 states have (on average 1.28314826910516) internal successors, (3929), 3089 states have internal predecessors, (3929), 953 states have call successors, (953), 193 states have call predecessors, (953), 191 states have return successors, (993), 936 states have call predecessors, (993), 945 states have call successors, (993) [2025-02-06 06:20:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 5875 transitions. [2025-02-06 06:20:33,790 INFO L78 Accepts]: Start accepts. Automaton has 4207 states and 5875 transitions. Word has length 243 [2025-02-06 06:20:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:33,792 INFO L471 AbstractCegarLoop]: Abstraction has 4207 states and 5875 transitions. [2025-02-06 06:20:33,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:20:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4207 states and 5875 transitions. [2025-02-06 06:20:33,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-02-06 06:20:33,796 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:33,796 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 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] [2025-02-06 06:20:33,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 06:20:33,796 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:33,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:33,797 INFO L85 PathProgramCache]: Analyzing trace with hash -892716651, now seen corresponding path program 1 times [2025-02-06 06:20:33,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:33,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568259193] [2025-02-06 06:20:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:33,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:34,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-02-06 06:20:34,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-02-06 06:20:34,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:34,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 06:20:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568259193] [2025-02-06 06:20:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568259193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967715283] [2025-02-06 06:20:34,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:34,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:34,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:34,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:34,214 INFO L87 Difference]: Start difference. First operand 4207 states and 5875 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:20:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:34,419 INFO L93 Difference]: Finished difference Result 8427 states and 11779 transitions. [2025-02-06 06:20:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:34,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 261 [2025-02-06 06:20:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:34,442 INFO L225 Difference]: With dead ends: 8427 [2025-02-06 06:20:34,442 INFO L226 Difference]: Without dead ends: 4223 [2025-02-06 06:20:34,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:34,455 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 2 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:34,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2929 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-06 06:20:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 4211. [2025-02-06 06:20:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4211 states, 3066 states have (on average 1.2827788649706457) internal successors, (3933), 3093 states have internal predecessors, (3933), 953 states have call successors, (953), 193 states have call predecessors, (953), 191 states have return successors, (993), 936 states have call predecessors, (993), 945 states have call successors, (993) [2025-02-06 06:20:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5879 transitions. [2025-02-06 06:20:34,598 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5879 transitions. Word has length 261 [2025-02-06 06:20:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:34,598 INFO L471 AbstractCegarLoop]: Abstraction has 4211 states and 5879 transitions. [2025-02-06 06:20:34,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-02-06 06:20:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5879 transitions. [2025-02-06 06:20:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-06 06:20:34,604 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:34,604 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 06:20:34,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 06:20:34,604 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:34,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1827817539, now seen corresponding path program 1 times [2025-02-06 06:20:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351002832] [2025-02-06 06:20:34,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:34,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:34,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 06:20:34,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 06:20:34,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:34,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:34,957 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-06 06:20:34,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351002832] [2025-02-06 06:20:34,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351002832] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:34,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710110364] [2025-02-06 06:20:34,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:34,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:34,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:34,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:34,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 06:20:35,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-06 06:20:36,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-06 06:20:36,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:36,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:36,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 2772 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:20:36,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 06:20:36,028 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:20:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710110364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:36,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:20:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 06:20:36,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929478008] [2025-02-06 06:20:36,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:36,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:36,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:36,030 INFO L87 Difference]: Start difference. First operand 4211 states and 5879 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:20:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:36,190 INFO L93 Difference]: Finished difference Result 8435 states and 11795 transitions. [2025-02-06 06:20:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:36,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 268 [2025-02-06 06:20:36,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:36,207 INFO L225 Difference]: With dead ends: 8435 [2025-02-06 06:20:36,207 INFO L226 Difference]: Without dead ends: 4227 [2025-02-06 06:20:36,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:36,216 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 2 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:36,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2929 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4227 states. [2025-02-06 06:20:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4227 to 4215. [2025-02-06 06:20:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4215 states, 3070 states have (on average 1.2824104234527687) internal successors, (3937), 3097 states have internal predecessors, (3937), 953 states have call successors, (953), 193 states have call predecessors, (953), 191 states have return successors, (993), 936 states have call predecessors, (993), 945 states have call successors, (993) [2025-02-06 06:20:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4215 states to 4215 states and 5883 transitions. [2025-02-06 06:20:36,331 INFO L78 Accepts]: Start accepts. Automaton has 4215 states and 5883 transitions. Word has length 268 [2025-02-06 06:20:36,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:36,331 INFO L471 AbstractCegarLoop]: Abstraction has 4215 states and 5883 transitions. [2025-02-06 06:20:36,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:20:36,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4215 states and 5883 transitions. [2025-02-06 06:20:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-06 06:20:36,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:36,336 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:36,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 06:20:36,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-06 06:20:36,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:36,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:36,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1847774947, now seen corresponding path program 1 times [2025-02-06 06:20:36,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:36,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811390074] [2025-02-06 06:20:36,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:36,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:36,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 06:20:36,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 06:20:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-06 06:20:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811390074] [2025-02-06 06:20:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811390074] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471468483] [2025-02-06 06:20:36,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:36,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:36,841 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:36,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 06:20:37,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-06 06:20:37,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-06 06:20:37,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:37,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:37,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:37,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-06 06:20:37,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:20:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-06 06:20:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471468483] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:20:38,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:20:38,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:20:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765803857] [2025-02-06 06:20:38,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:20:38,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:20:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:38,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:20:38,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:38,153 INFO L87 Difference]: Start difference. First operand 4215 states and 5883 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-02-06 06:20:38,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:38,284 INFO L93 Difference]: Finished difference Result 8475 states and 11843 transitions. [2025-02-06 06:20:38,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:38,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) Word has length 275 [2025-02-06 06:20:38,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:38,303 INFO L225 Difference]: With dead ends: 8475 [2025-02-06 06:20:38,304 INFO L226 Difference]: Without dead ends: 4263 [2025-02-06 06:20:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:38,313 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 4 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:38,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2928 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-02-06 06:20:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 4263. [2025-02-06 06:20:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3106 states have (on average 1.2791371538956857) internal successors, (3973), 3133 states have internal predecessors, (3973), 965 states have call successors, (965), 193 states have call predecessors, (965), 191 states have return successors, (1005), 948 states have call predecessors, (1005), 957 states have call successors, (1005) [2025-02-06 06:20:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5943 transitions. [2025-02-06 06:20:38,436 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5943 transitions. Word has length 275 [2025-02-06 06:20:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:38,437 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5943 transitions. [2025-02-06 06:20:38,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-02-06 06:20:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5943 transitions. [2025-02-06 06:20:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-06 06:20:38,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:38,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 06:20:38,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 06:20:38,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 06:20:38,644 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1344479477, now seen corresponding path program 2 times [2025-02-06 06:20:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:38,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609818885] [2025-02-06 06:20:38,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:20:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:38,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-02-06 06:20:38,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 296 statements. [2025-02-06 06:20:38,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:20:38,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-02-06 06:20:38,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:38,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609818885] [2025-02-06 06:20:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609818885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:38,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267144702] [2025-02-06 06:20:38,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:38,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:38,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:38,959 INFO L87 Difference]: Start difference. First operand 4263 states and 5943 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 06:20:42,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:20:42,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:42,389 INFO L93 Difference]: Finished difference Result 8528 states and 11887 transitions. [2025-02-06 06:20:42,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:42,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 296 [2025-02-06 06:20:42,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:42,411 INFO L225 Difference]: With dead ends: 8528 [2025-02-06 06:20:42,412 INFO L226 Difference]: Without dead ends: 4268 [2025-02-06 06:20:42,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:42,424 INFO L435 NwaCegarLoop]: 2829 mSDtfsCounter, 1446 mSDsluCounter, 1457 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 4286 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:42,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 4286 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-06 06:20:42,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-02-06 06:20:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4250. [2025-02-06 06:20:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3095 states have (on average 1.278513731825525) internal successors, (3957), 3124 states have internal predecessors, (3957), 963 states have call successors, (963), 192 states have call predecessors, (963), 191 states have return successors, (981), 945 states have call predecessors, (981), 945 states have call successors, (981) [2025-02-06 06:20:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 5901 transitions. [2025-02-06 06:20:42,606 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 5901 transitions. Word has length 296 [2025-02-06 06:20:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:42,607 INFO L471 AbstractCegarLoop]: Abstraction has 4250 states and 5901 transitions. [2025-02-06 06:20:42,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 06:20:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 5901 transitions. [2025-02-06 06:20:42,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-06 06:20:42,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:42,612 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2025-02-06 06:20:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 06:20:42,612 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1637882484, now seen corresponding path program 1 times [2025-02-06 06:20:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973561110] [2025-02-06 06:20:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:42,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-06 06:20:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-06 06:20:42,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:42,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 06:20:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973561110] [2025-02-06 06:20:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973561110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641225191] [2025-02-06 06:20:42,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:42,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:42,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 06:20:43,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-06 06:20:44,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-06 06:20:44,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:44,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:44,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:44,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-02-06 06:20:44,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:20:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-02-06 06:20:44,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641225191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:20:44,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:20:44,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:20:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286794480] [2025-02-06 06:20:44,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:20:44,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:20:44,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:44,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:20:44,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:44,247 INFO L87 Difference]: Start difference. First operand 4250 states and 5901 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-06 06:20:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:44,398 INFO L93 Difference]: Finished difference Result 8545 states and 11887 transitions. [2025-02-06 06:20:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:44,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 296 [2025-02-06 06:20:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:44,417 INFO L225 Difference]: With dead ends: 8545 [2025-02-06 06:20:44,417 INFO L226 Difference]: Without dead ends: 4298 [2025-02-06 06:20:44,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:44,426 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 4 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:44,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4390 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2025-02-06 06:20:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4298. [2025-02-06 06:20:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 3131 states have (on average 1.2753114021079528) internal successors, (3993), 3160 states have internal predecessors, (3993), 975 states have call successors, (975), 192 states have call predecessors, (975), 191 states have return successors, (993), 957 states have call predecessors, (993), 957 states have call successors, (993) [2025-02-06 06:20:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5961 transitions. [2025-02-06 06:20:44,548 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5961 transitions. Word has length 296 [2025-02-06 06:20:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 4298 states and 5961 transitions. [2025-02-06 06:20:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-02-06 06:20:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5961 transitions. [2025-02-06 06:20:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-02-06 06:20:44,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:44,554 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2025-02-06 06:20:44,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 06:20:44,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:44,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash 240574230, now seen corresponding path program 2 times [2025-02-06 06:20:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882669748] [2025-02-06 06:20:44,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:20:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:44,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-02-06 06:20:44,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 317 statements. [2025-02-06 06:20:44,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 06:20:44,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-06 06:20:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882669748] [2025-02-06 06:20:44,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882669748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:44,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:44,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:20:44,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838556675] [2025-02-06 06:20:44,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:20:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:44,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:20:44,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:20:44,998 INFO L87 Difference]: Start difference. First operand 4298 states and 5961 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 06:20:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:45,192 INFO L93 Difference]: Finished difference Result 4309 states and 5969 transitions. [2025-02-06 06:20:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 317 [2025-02-06 06:20:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:45,207 INFO L225 Difference]: With dead ends: 4309 [2025-02-06 06:20:45,208 INFO L226 Difference]: Without dead ends: 4286 [2025-02-06 06:20:45,209 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-02-06 06:20:45,209 INFO L435 NwaCegarLoop]: 1472 mSDtfsCounter, 0 mSDsluCounter, 5874 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7346 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:45,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7346 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2025-02-06 06:20:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4286. [2025-02-06 06:20:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 3122 states have (on average 1.2741832158872517) internal successors, (3978), 3150 states have internal predecessors, (3978), 972 states have call successors, (972), 192 states have call predecessors, (972), 191 states have return successors, (991), 955 states have call predecessors, (991), 955 states have call successors, (991) [2025-02-06 06:20:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5941 transitions. [2025-02-06 06:20:45,322 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5941 transitions. Word has length 317 [2025-02-06 06:20:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:45,323 INFO L471 AbstractCegarLoop]: Abstraction has 4286 states and 5941 transitions. [2025-02-06 06:20:45,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-02-06 06:20:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5941 transitions. [2025-02-06 06:20:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-06 06:20:45,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:45,329 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:45,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 06:20:45,329 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 618137173, now seen corresponding path program 1 times [2025-02-06 06:20:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15179094] [2025-02-06 06:20:45,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:45,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-06 06:20:45,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-06 06:20:45,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:45,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-02-06 06:20:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15179094] [2025-02-06 06:20:45,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15179094] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:45,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159787136] [2025-02-06 06:20:45,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:45,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:45,662 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:45,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 06:20:46,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-06 06:20:47,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-06 06:20:47,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:47,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:47,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:47,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-02-06 06:20:47,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:20:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159787136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:47,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:20:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 06:20:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538965091] [2025-02-06 06:20:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:47,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:47,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:47,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:47,065 INFO L87 Difference]: Start difference. First operand 4286 states and 5941 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:20:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:47,198 INFO L93 Difference]: Finished difference Result 8577 states and 11891 transitions. [2025-02-06 06:20:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:47,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 311 [2025-02-06 06:20:47,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:47,217 INFO L225 Difference]: With dead ends: 8577 [2025-02-06 06:20:47,217 INFO L226 Difference]: Without dead ends: 4294 [2025-02-06 06:20:47,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:47,227 INFO L435 NwaCegarLoop]: 1467 mSDtfsCounter, 0 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2925 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:47,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2925 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2025-02-06 06:20:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 4294. [2025-02-06 06:20:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4294 states, 3130 states have (on average 1.2734824281150159) internal successors, (3986), 3158 states have internal predecessors, (3986), 972 states have call successors, (972), 192 states have call predecessors, (972), 191 states have return successors, (991), 955 states have call predecessors, (991), 955 states have call successors, (991) [2025-02-06 06:20:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 5949 transitions. [2025-02-06 06:20:47,348 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 5949 transitions. Word has length 311 [2025-02-06 06:20:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:47,348 INFO L471 AbstractCegarLoop]: Abstraction has 4294 states and 5949 transitions. [2025-02-06 06:20:47,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 06:20:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 5949 transitions. [2025-02-06 06:20:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-06 06:20:47,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:47,354 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:47,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 06:20:47,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:47,559 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:47,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 898487062, now seen corresponding path program 1 times [2025-02-06 06:20:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405484763] [2025-02-06 06:20:47,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:47,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-06 06:20:47,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-06 06:20:47,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:47,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-02-06 06:20:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405484763] [2025-02-06 06:20:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405484763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:20:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611158645] [2025-02-06 06:20:47,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:47,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:47,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:20:47,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:20:47,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 06:20:48,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-06 06:20:49,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-06 06:20:49,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:49,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:49,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:20:49,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:20:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-02-06 06:20:49,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:20:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-02-06 06:20:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611158645] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:20:49,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:20:49,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:20:49,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052752989] [2025-02-06 06:20:49,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:20:49,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:20:49,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:49,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:20:49,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:49,598 INFO L87 Difference]: Start difference. First operand 4294 states and 5949 transitions. Second operand has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-06 06:20:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:50,664 INFO L93 Difference]: Finished difference Result 8717 states and 12063 transitions. [2025-02-06 06:20:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 311 [2025-02-06 06:20:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:50,691 INFO L225 Difference]: With dead ends: 8717 [2025-02-06 06:20:50,694 INFO L226 Difference]: Without dead ends: 4426 [2025-02-06 06:20:50,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:20:50,705 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 8 mSDsluCounter, 4391 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5857 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:50,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5857 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 06:20:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4426 states. [2025-02-06 06:20:50,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4426 to 4426. [2025-02-06 06:20:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4426 states, 3262 states have (on average 1.2660944206008584) internal successors, (4130), 3290 states have internal predecessors, (4130), 972 states have call successors, (972), 192 states have call predecessors, (972), 191 states have return successors, (991), 955 states have call predecessors, (991), 955 states have call successors, (991) [2025-02-06 06:20:50,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4426 states to 4426 states and 6093 transitions. [2025-02-06 06:20:50,838 INFO L78 Accepts]: Start accepts. Automaton has 4426 states and 6093 transitions. Word has length 311 [2025-02-06 06:20:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:50,839 INFO L471 AbstractCegarLoop]: Abstraction has 4426 states and 6093 transitions. [2025-02-06 06:20:50,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-02-06 06:20:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 4426 states and 6093 transitions. [2025-02-06 06:20:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-06 06:20:50,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:50,845 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:50,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 06:20:51,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:20:51,046 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:51,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1247948669, now seen corresponding path program 1 times [2025-02-06 06:20:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562989447] [2025-02-06 06:20:51,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:51,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-06 06:20:51,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-06 06:20:51,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:51,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-06 06:20:51,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562989447] [2025-02-06 06:20:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562989447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:20:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429879292] [2025-02-06 06:20:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:20:51,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:51,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:20:51,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:51,381 INFO L87 Difference]: Start difference. First operand 4426 states and 6093 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:20:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:51,591 INFO L93 Difference]: Finished difference Result 8845 states and 12179 transitions. [2025-02-06 06:20:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:20:51,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 340 [2025-02-06 06:20:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:51,615 INFO L225 Difference]: With dead ends: 8845 [2025-02-06 06:20:51,615 INFO L226 Difference]: Without dead ends: 4422 [2025-02-06 06:20:51,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:20:51,627 INFO L435 NwaCegarLoop]: 1466 mSDtfsCounter, 0 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:51,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2919 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 06:20:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2025-02-06 06:20:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4422. [2025-02-06 06:20:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4422 states, 3258 states have (on average 1.2651933701657458) internal successors, (4122), 3282 states have internal predecessors, (4122), 972 states have call successors, (972), 192 states have call predecessors, (972), 191 states have return successors, (991), 955 states have call predecessors, (991), 955 states have call successors, (991) [2025-02-06 06:20:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 6085 transitions. [2025-02-06 06:20:51,831 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 6085 transitions. Word has length 340 [2025-02-06 06:20:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:51,831 INFO L471 AbstractCegarLoop]: Abstraction has 4422 states and 6085 transitions. [2025-02-06 06:20:51,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-02-06 06:20:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 6085 transitions. [2025-02-06 06:20:51,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-02-06 06:20:51,837 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:51,837 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:51,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 06:20:51,837 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 150675314, now seen corresponding path program 1 times [2025-02-06 06:20:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307212809] [2025-02-06 06:20:51,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:51,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-02-06 06:20:52,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-02-06 06:20:52,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-06 06:20:52,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:52,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307212809] [2025-02-06 06:20:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307212809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:52,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 06:20:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195718314] [2025-02-06 06:20:52,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:52,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 06:20:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:52,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 06:20:52,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:20:52,249 INFO L87 Difference]: Start difference. First operand 4422 states and 6085 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:20:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:52,404 INFO L93 Difference]: Finished difference Result 6539 states and 9002 transitions. [2025-02-06 06:20:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:20:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 357 [2025-02-06 06:20:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:52,427 INFO L225 Difference]: With dead ends: 6539 [2025-02-06 06:20:52,428 INFO L226 Difference]: Without dead ends: 4410 [2025-02-06 06:20:52,433 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-02-06 06:20:52,434 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 0 mSDsluCounter, 5850 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7314 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7314 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2025-02-06 06:20:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4410. [2025-02-06 06:20:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 3248 states have (on average 1.2653940886699508) internal successors, (4110), 3274 states have internal predecessors, (4110), 972 states have call successors, (972), 192 states have call predecessors, (972), 189 states have return successors, (987), 951 states have call predecessors, (987), 955 states have call successors, (987) [2025-02-06 06:20:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 6069 transitions. [2025-02-06 06:20:52,626 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 6069 transitions. Word has length 357 [2025-02-06 06:20:52,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:52,627 INFO L471 AbstractCegarLoop]: Abstraction has 4410 states and 6069 transitions. [2025-02-06 06:20:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-06 06:20:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 6069 transitions. [2025-02-06 06:20:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-02-06 06:20:52,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:52,634 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:52,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 06:20:52,634 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:52,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:52,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1564085318, now seen corresponding path program 1 times [2025-02-06 06:20:52,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:52,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806296688] [2025-02-06 06:20:52,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-02-06 06:20:52,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-02-06 06:20:52,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:52,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-02-06 06:20:53,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806296688] [2025-02-06 06:20:53,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806296688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:53,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:53,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:20:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568530723] [2025-02-06 06:20:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:20:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:53,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:20:53,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:53,043 INFO L87 Difference]: Start difference. First operand 4410 states and 6069 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-06 06:20:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:20:53,214 INFO L93 Difference]: Finished difference Result 4455 states and 6111 transitions. [2025-02-06 06:20:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:20:53,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 380 [2025-02-06 06:20:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:20:53,231 INFO L225 Difference]: With dead ends: 4455 [2025-02-06 06:20:53,232 INFO L226 Difference]: Without dead ends: 2304 [2025-02-06 06:20:53,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:53,237 INFO L435 NwaCegarLoop]: 1457 mSDtfsCounter, 0 mSDsluCounter, 4356 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5813 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:20:53,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5813 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:20:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2025-02-06 06:20:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2025-02-06 06:20:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1692 states have (on average 1.261820330969267) internal successors, (2135), 1704 states have internal predecessors, (2135), 509 states have call successors, (509), 105 states have call predecessors, (509), 102 states have return successors, (502), 498 states have call predecessors, (502), 498 states have call successors, (502) [2025-02-06 06:20:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3146 transitions. [2025-02-06 06:20:53,317 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3146 transitions. Word has length 380 [2025-02-06 06:20:53,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:20:53,318 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 3146 transitions. [2025-02-06 06:20:53,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-02-06 06:20:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3146 transitions. [2025-02-06 06:20:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-02-06 06:20:53,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:20:53,323 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:20:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 06:20:53,324 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:20:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:20:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1959473593, now seen corresponding path program 1 times [2025-02-06 06:20:53,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:20:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130140667] [2025-02-06 06:20:53,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:20:53,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:20:53,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-02-06 06:20:53,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-02-06 06:20:53,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:20:53,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:20:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-02-06 06:20:53,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:20:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130140667] [2025-02-06 06:20:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130140667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:20:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:20:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:20:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388388100] [2025-02-06 06:20:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:20:53,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:20:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:20:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:20:53,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:20:53,951 INFO L87 Difference]: Start difference. First operand 2304 states and 3146 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-06 06:20:58,020 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-02-06 06:21:02,026 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-02-06 06:21:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:21:02,077 INFO L93 Difference]: Finished difference Result 4613 states and 6315 transitions. [2025-02-06 06:21:02,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:21:02,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) Word has length 392 [2025-02-06 06:21:02,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:21:02,094 INFO L225 Difference]: With dead ends: 4613 [2025-02-06 06:21:02,095 INFO L226 Difference]: Without dead ends: 2312 [2025-02-06 06:21:02,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:21:02,100 INFO L435 NwaCegarLoop]: 1458 mSDtfsCounter, 0 mSDsluCounter, 4364 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5822 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:21:02,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5822 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-02-06 06:21:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2025-02-06 06:21:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 2312. [2025-02-06 06:21:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2312 states, 1698 states have (on average 1.2608951707891638) internal successors, (2141), 1710 states have internal predecessors, (2141), 509 states have call successors, (509), 105 states have call predecessors, (509), 104 states have return successors, (520), 500 states have call predecessors, (520), 498 states have call successors, (520) [2025-02-06 06:21:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3170 transitions. [2025-02-06 06:21:02,163 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3170 transitions. Word has length 392 [2025-02-06 06:21:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:21:02,164 INFO L471 AbstractCegarLoop]: Abstraction has 2312 states and 3170 transitions. [2025-02-06 06:21:02,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-02-06 06:21:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3170 transitions. [2025-02-06 06:21:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-02-06 06:21:02,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:21:02,168 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:21:02,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 06:21:02,168 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:21:02,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:21:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1022819889, now seen corresponding path program 1 times [2025-02-06 06:21:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:21:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385158296] [2025-02-06 06:21:02,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:21:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:21:02,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-02-06 06:21:02,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-02-06 06:21:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:21:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:21:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-06 06:21:02,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:21:02,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385158296] [2025-02-06 06:21:02,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385158296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:21:02,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:21:02,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 06:21:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666884409] [2025-02-06 06:21:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:21:02,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 06:21:02,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:21:02,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 06:21:02,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 06:21:02,803 INFO L87 Difference]: Start difference. First operand 2312 states and 3170 transitions. Second operand has 8 states, 8 states have (on average 27.375) internal successors, (219), 7 states have internal predecessors, (219), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39)