./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:56:36,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:56:36,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:56:36,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:56:36,330 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:56:36,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:56:36,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:56:36,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:56:36,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:56:36,349 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:56:36,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:56:36,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:56:36,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:56:36,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:56:36,350 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:56:36,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:56:36,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:56:36,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:56:36,353 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 106df4f5c2a241158f9b42d6bacea5fef4152f7015c080096ac6f687357e10b4 [2025-03-04 03:56:36,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:56:36,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:56:36,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:56:36,632 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:56:36,632 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:56:36,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-04 03:56:37,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3a4ebf0/b974d96ea63849b3ad1dfcfaed63c4a3/FLAGbcf20f559 [2025-03-04 03:56:38,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:56:38,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-04 03:56:38,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3a4ebf0/b974d96ea63849b3ad1dfcfaed63c4a3/FLAGbcf20f559 [2025-03-04 03:56:38,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b3a4ebf0/b974d96ea63849b3ad1dfcfaed63c4a3 [2025-03-04 03:56:38,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:56:38,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:56:38,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:56:38,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:56:38,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:56:38,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:56:38" (1/1) ... [2025-03-04 03:56:38,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a374779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:38, skipping insertion in model container [2025-03-04 03:56:38,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:56:38" (1/1) ... [2025-03-04 03:56:38,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:56:39,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-03-04 03:56:39,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:56:40,003 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:56:40,096 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-03-04 03:56:40,098 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-03-04 03:56:40,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [6119] [2025-03-04 03:56:40,102 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-03-04 03:56:40,102 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-03-04 03:56:40,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i[247200,247213] [2025-03-04 03:56:40,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:56:40,327 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:56:40,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40 WrapperNode [2025-03-04 03:56:40,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:56:40,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:56:40,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:56:40,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:56:40,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,510 INFO L138 Inliner]: procedures = 216, calls = 1507, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3386 [2025-03-04 03:56:40,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:56:40,511 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:56:40,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:56:40,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:56:40,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,965 INFO L175 MemorySlicer]: Split 587 memory accesses to 18 slices as follows [2, 2, 3, 1, 1, 5, 5, 8, 8, 110, 4, 1, 2, 8, 8, 1, 415, 3]. 71 percent of accesses are in the largest equivalence class. The 129 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 8, 110, 0, 1, 0, 0, 8, 0, 0, 0]. The 239 writes are split as follows [0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 1, 0, 0, 231, 1]. [2025-03-04 03:56:40,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:40,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:56:41,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:56:41,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:56:41,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:56:41,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (1/1) ... [2025-03-04 03:56:41,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:56:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:56:41,172 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:56:41,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:56:41,210 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-04 03:56:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-04 03:56:41,210 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2025-03-04 03:56:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-04 03:56:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:56:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:56:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:56:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:56:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 03:56:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 03:56:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 03:56:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 03:56:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 03:56:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 03:56:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 03:56:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:56:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2025-03-04 03:56:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 03:56:41,215 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 03:56:41,216 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:56:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:56:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:56:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 03:56:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 03:56:41,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 03:56:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 03:56:41,220 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 03:56:41,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 03:56:41,221 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 03:56:41,221 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2025-03-04 03:56:41,222 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 03:56:41,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-04 03:56:41,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-04 03:56:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-04 03:56:41,226 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-04 03:56:41,226 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 03:56:41,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:56:41,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 03:56:41,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-04 03:56:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-04 03:56:41,229 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:56:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:56:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-04 03:56:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2025-03-04 03:56:41,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:56:41,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2025-03-04 03:56:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2025-03-04 03:56:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:56:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2025-03-04 03:56:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2025-03-04 03:56:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:56:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-04 03:56:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:56:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-04 03:56:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2025-03-04 03:56:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 03:56:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:56:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:56:41,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 03:56:41,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 03:56:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 03:56:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 03:56:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 03:56:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 03:56:41,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:56:41,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:56:41,939 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:56:41,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:56:42,209 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6195: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-04 03:56:42,303 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9401: havoc #t~nondet880; [2025-03-04 03:56:42,450 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9397: havoc #t~nondet879; [2025-03-04 03:56:42,452 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc #t~nondet866; [2025-03-04 03:56:42,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6257: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 03:56:42,503 INFO L1325 $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-03-04 03:56:42,934 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9340: havoc #t~nondet869; [2025-03-04 03:56:42,936 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9351: havoc #t~nondet871; [2025-03-04 03:56:42,950 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-03-04 03:56:42,970 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc #t~bitwise1; [2025-03-04 03:56:42,972 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9244: havoc #t~nondet856; [2025-03-04 03:56:42,977 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9264: havoc dev_set_drvdata_#t~nondet859#1; [2025-03-04 03:56:43,013 INFO L1325 $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-03-04 03:56:43,017 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9380: havoc #t~ret877.base, #t~ret877.offset; [2025-03-04 03:56:43,031 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: havoc #t~mem65.base, #t~mem65.offset; [2025-03-04 03:56:43,038 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9384: havoc #t~nondet878; [2025-03-04 03:56:43,054 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc #t~mem137;havoc #t~bitwise138; [2025-03-04 03:56:43,176 INFO L1325 $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-03-04 03:56:43,176 INFO L1325 $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-03-04 03:56:43,597 INFO L1325 $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-03-04 03:56:51,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6510: havoc input_allocate_device_#t~ret146#1.base, input_allocate_device_#t~ret146#1.offset; [2025-03-04 03:56:51,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9289: havoc dvb_net_init_#t~nondet863#1; [2025-03-04 03:56:51,713 INFO L1325 $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-03-04 03:56:51,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc request_firmware_#t~nondet872#1; [2025-03-04 03:56:51,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9362: havoc strlcat_#t~nondet873#1; [2025-03-04 03:56:51,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9296: havoc dvb_register_adapter_#t~nondet864#1; [2025-03-04 03:56:51,713 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9300: havoc dvb_register_frontend_#t~nondet865#1; [2025-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9371: havoc ttusbdecfe_dvbs_attach_#t~ret874#1.base, ttusbdecfe_dvbs_attach_#t~ret874#1.offset; [2025-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9308: havoc dvb_unregister_frontend_#t~nondet867#1; [2025-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9374: havoc ttusbdecfe_dvbt_attach_#t~ret875#1.base, ttusbdecfe_dvbt_attach_#t~ret875#1.offset; [2025-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9377: havoc usb_alloc_coherent_#t~ret876#1.base, usb_alloc_coherent_#t~ret876#1.offset; [2025-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc crc32_le_#t~nondet857#1; [2025-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9318: havoc input_register_device_#t~nondet868#1; [2025-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260: havoc dev_get_drvdata_#t~ret858#1.base, dev_get_drvdata_#t~ret858#1.offset; [2025-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9268: havoc dvb_dmx_init_#t~nondet860#1; [2025-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc dvb_dmxdev_init_#t~nondet861#1; [2025-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:51,714 INFO L1325 $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-03-04 03:56:52,012 INFO L? ?]: Removed 1615 outVars from TransFormulas that were not future-live. [2025-03-04 03:56:52,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:56:52,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:56:52,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:56:52,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:56:52 BoogieIcfgContainer [2025-03-04 03:56:52,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:56:52,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:56:52,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:56:52,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:56:52,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:56:38" (1/3) ... [2025-03-04 03:56:52,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a3f303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:56:52, skipping insertion in model container [2025-03-04 03:56:52,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:56:40" (2/3) ... [2025-03-04 03:56:52,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47a3f303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:56:52, skipping insertion in model container [2025-03-04 03:56:52,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:56:52" (3/3) ... [2025-03-04 03:56:52,070 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-03-04 03:56:52,080 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:56:52,081 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-03-04 03:56:52,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:56:52,161 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;@3d0b646c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:56:52,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:56:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-04 03:56:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 03:56:52,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:52,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:52,173 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:52,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 202142642, now seen corresponding path program 1 times [2025-03-04 03:56:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:52,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886577063] [2025-03-04 03:56:52,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:52,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 03:56:52,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 03:56:52,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:52,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:52,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:52,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886577063] [2025-03-04 03:56:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886577063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:52,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:52,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012811438] [2025-03-04 03:56:52,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:52,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:52,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:52,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:52,869 INFO L87 Difference]: Start difference. First operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) 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-03-04 03:56:55,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:56:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:55,591 INFO L93 Difference]: Finished difference Result 3399 states and 4915 transitions. [2025-03-04 03:56:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:55,593 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-03-04 03:56:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:55,614 INFO L225 Difference]: With dead ends: 3399 [2025-03-04 03:56:55,614 INFO L226 Difference]: Without dead ends: 2252 [2025-03-04 03:56:55,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:55,629 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1597 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 3231 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-03-04 03:56:55,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 3231 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 03:56:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-04 03:56:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2247. [2025-03-04 03:56:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1616 states have (on average 1.3044554455445545) internal successors, (2108), 1647 states have internal predecessors, (2108), 531 states have call successors, (531), 101 states have call predecessors, (531), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-04 03:56:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3171 transitions. [2025-03-04 03:56:55,869 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3171 transitions. Word has length 9 [2025-03-04 03:56:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3171 transitions. [2025-03-04 03:56:55,870 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-03-04 03:56:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3171 transitions. [2025-03-04 03:56:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 03:56:55,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:55,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:55,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:56:55,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:55,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1970239440, now seen corresponding path program 1 times [2025-03-04 03:56:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610084376] [2025-03-04 03:56:55,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:56,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 03:56:56,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 03:56:56,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:56,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610084376] [2025-03-04 03:56:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610084376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770468407] [2025-03-04 03:56:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:56,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:56,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:56,161 INFO L87 Difference]: Start difference. First operand 2247 states and 3171 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-03-04 03:56:58,457 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-03-04 03:56:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:56:58,599 INFO L93 Difference]: Finished difference Result 2249 states and 3172 transitions. [2025-03-04 03:56:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:56:58,599 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-03-04 03:56:58,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:56:58,617 INFO L225 Difference]: With dead ends: 2249 [2025-03-04 03:56:58,617 INFO L226 Difference]: Without dead ends: 2246 [2025-03-04 03:56:58,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:58,621 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 1589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1579 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:56:58,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1579 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 03:56:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-04 03:56:58,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-03-04 03:56:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1616 states have (on average 1.3038366336633664) internal successors, (2107), 1646 states have internal predecessors, (2107), 530 states have call successors, (530), 101 states have call predecessors, (530), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-04 03:56:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3169 transitions. [2025-03-04 03:56:58,739 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3169 transitions. Word has length 10 [2025-03-04 03:56:58,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:56:58,740 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3169 transitions. [2025-03-04 03:56:58,740 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-03-04 03:56:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3169 transitions. [2025-03-04 03:56:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 03:56:58,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:56:58,741 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:56:58,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:56:58,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:56:58,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:56:58,742 INFO L85 PathProgramCache]: Analyzing trace with hash 946664307, now seen corresponding path program 1 times [2025-03-04 03:56:58,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:56:58,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717305011] [2025-03-04 03:56:58,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:56:58,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:56:58,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 03:56:58,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 03:56:58,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:56:58,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:56:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:56:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:56:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717305011] [2025-03-04 03:56:59,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717305011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:56:59,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:56:59,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:56:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13285565] [2025-03-04 03:56:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:56:59,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:56:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:56:59,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:56:59,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:56:59,021 INFO L87 Difference]: Start difference. First operand 2246 states and 3169 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-03-04 03:57:02,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:57:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:02,140 INFO L93 Difference]: Finished difference Result 2248 states and 3170 transitions. [2025-03-04 03:57:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:02,141 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-03-04 03:57:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:02,151 INFO L225 Difference]: With dead ends: 2248 [2025-03-04 03:57:02,152 INFO L226 Difference]: Without dead ends: 2245 [2025-03-04 03:57:02,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:02,153 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1586 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:02,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 1577 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-04 03:57:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-03-04 03:57:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2025-03-04 03:57:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1616 states have (on average 1.3032178217821782) internal successors, (2106), 1645 states have internal predecessors, (2106), 529 states have call successors, (529), 101 states have call predecessors, (529), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-04 03:57:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3167 transitions. [2025-03-04 03:57:02,250 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3167 transitions. Word has length 11 [2025-03-04 03:57:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:02,251 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3167 transitions. [2025-03-04 03:57:02,251 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-03-04 03:57:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3167 transitions. [2025-03-04 03:57:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 03:57:02,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:02,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:57:02,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:57:02,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash -719394767, now seen corresponding path program 1 times [2025-03-04 03:57:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950094106] [2025-03-04 03:57:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 03:57:02,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 03:57:02,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:02,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:57:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:02,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950094106] [2025-03-04 03:57:02,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950094106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:02,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:02,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181294699] [2025-03-04 03:57:02,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:02,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:02,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:02,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:02,479 INFO L87 Difference]: Start difference. First operand 2245 states and 3167 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-03-04 03:57:06,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:57:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:06,725 INFO L93 Difference]: Finished difference Result 6690 states and 9549 transitions. [2025-03-04 03:57:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:06,726 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-03-04 03:57:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:06,752 INFO L225 Difference]: With dead ends: 6690 [2025-03-04 03:57:06,752 INFO L226 Difference]: Without dead ends: 4443 [2025-03-04 03:57:06,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:06,765 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1591 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:06,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 3180 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 03:57:06,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-03-04 03:57:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4421. [2025-03-04 03:57:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4421 states, 3191 states have (on average 1.3042933249764963) internal successors, (4162), 3247 states have internal predecessors, (4162), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-03-04 03:57:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 6294 transitions. [2025-03-04 03:57:06,968 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 6294 transitions. Word has length 12 [2025-03-04 03:57:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 4421 states and 6294 transitions. [2025-03-04 03:57:06,969 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-03-04 03:57:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 6294 transitions. [2025-03-04 03:57:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 03:57:06,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:06,979 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-03-04 03:57:06,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:57:06,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:06,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2097492222, now seen corresponding path program 1 times [2025-03-04 03:57:06,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:06,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178908540] [2025-03-04 03:57:06,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:06,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:07,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 03:57:07,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 03:57:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 03:57:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:07,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178908540] [2025-03-04 03:57:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178908540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:07,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:07,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538435040] [2025-03-04 03:57:07,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:07,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:07,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:07,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:07,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:07,421 INFO L87 Difference]: Start difference. First operand 4421 states and 6294 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-03-04 03:57:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:07,616 INFO L93 Difference]: Finished difference Result 8886 states and 12656 transitions. [2025-03-04 03:57:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:07,617 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-03-04 03:57:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:07,643 INFO L225 Difference]: With dead ends: 8886 [2025-03-04 03:57:07,643 INFO L226 Difference]: Without dead ends: 4468 [2025-03-04 03:57:07,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:07,669 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 430 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2635 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-03-04 03:57:07,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2025-03-04 03:57:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4457. [2025-03-04 03:57:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 3227 states have (on average 1.305546947629377) internal successors, (4213), 3283 states have internal predecessors, (4213), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-03-04 03:57:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 6345 transitions. [2025-03-04 03:57:07,898 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 6345 transitions. Word has length 138 [2025-03-04 03:57:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:07,898 INFO L471 AbstractCegarLoop]: Abstraction has 4457 states and 6345 transitions. [2025-03-04 03:57:07,899 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-03-04 03:57:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 6345 transitions. [2025-03-04 03:57:07,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 03:57:07,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:07,904 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-03-04 03:57:07,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:57:07,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -333994969, now seen corresponding path program 1 times [2025-03-04 03:57:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727750905] [2025-03-04 03:57:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:08,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 03:57:08,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 03:57:08,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:08,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 03:57:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:08,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727750905] [2025-03-04 03:57:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727750905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:08,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:08,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231310568] [2025-03-04 03:57:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:08,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:08,333 INFO L87 Difference]: Start difference. First operand 4457 states and 6345 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-03-04 03:57:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:08,521 INFO L93 Difference]: Finished difference Result 8691 states and 12367 transitions. [2025-03-04 03:57:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:08,522 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-03-04 03:57:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:08,549 INFO L225 Difference]: With dead ends: 8691 [2025-03-04 03:57:08,549 INFO L226 Difference]: Without dead ends: 4237 [2025-03-04 03:57:08,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:08,571 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 1471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1495 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-03-04 03:57:08,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2025-03-04 03:57:08,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 4237. [2025-03-04 03:57:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4237 states, 3047 states have (on average 1.3012799474893337) internal successors, (3965), 3103 states have internal predecessors, (3965), 994 states have call successors, (994), 198 states have call predecessors, (994), 195 states have return successors, (1054), 955 states have call predecessors, (1054), 982 states have call successors, (1054) [2025-03-04 03:57:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4237 states to 4237 states and 6013 transitions. [2025-03-04 03:57:08,787 INFO L78 Accepts]: Start accepts. Automaton has 4237 states and 6013 transitions. Word has length 156 [2025-03-04 03:57:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 4237 states and 6013 transitions. [2025-03-04 03:57:08,788 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-03-04 03:57:08,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4237 states and 6013 transitions. [2025-03-04 03:57:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 03:57:08,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:08,792 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-03-04 03:57:08,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:57:08,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash -875364392, now seen corresponding path program 1 times [2025-03-04 03:57:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356708892] [2025-03-04 03:57:08,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:08,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:08,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 03:57:08,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 03:57:08,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:08,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 03:57:09,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:09,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356708892] [2025-03-04 03:57:09,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356708892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:09,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:57:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856426344] [2025-03-04 03:57:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:09,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:57:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:09,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:57:09,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:57:09,132 INFO L87 Difference]: Start difference. First operand 4237 states and 6013 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-03-04 03:57:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:09,432 INFO L93 Difference]: Finished difference Result 8487 states and 12042 transitions. [2025-03-04 03:57:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:57:09,436 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-03-04 03:57:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:09,464 INFO L225 Difference]: With dead ends: 8487 [2025-03-04 03:57:09,464 INFO L226 Difference]: Without dead ends: 4247 [2025-03-04 03:57:09,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:57:09,486 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 0 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4480 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-03-04 03:57:09,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4480 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2025-03-04 03:57:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4247. [2025-03-04 03:57:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 3058 states have (on average 1.2998691955526487) internal successors, (3975), 3114 states have internal predecessors, (3975), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-04 03:57:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 6021 transitions. [2025-03-04 03:57:09,744 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 6021 transitions. Word has length 174 [2025-03-04 03:57:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:09,745 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 6021 transitions. [2025-03-04 03:57:09,746 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-03-04 03:57:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 6021 transitions. [2025-03-04 03:57:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-04 03:57:09,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:09,749 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-03-04 03:57:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:57:09,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:09,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash 107848569, now seen corresponding path program 1 times [2025-03-04 03:57:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:09,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016720760] [2025-03-04 03:57:09,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:09,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:09,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-04 03:57:09,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-04 03:57:09,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 03:57:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016720760] [2025-03-04 03:57:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016720760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:57:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117101572] [2025-03-04 03:57:10,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:10,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:57:10,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:10,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:57:10,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:10,399 INFO L87 Difference]: Start difference. First operand 4247 states and 6021 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-03-04 03:57:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:10,667 INFO L93 Difference]: Finished difference Result 8503 states and 12055 transitions. [2025-03-04 03:57:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:57:10,668 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-03-04 03:57:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:10,691 INFO L225 Difference]: With dead ends: 8503 [2025-03-04 03:57:10,691 INFO L226 Difference]: Without dead ends: 4259 [2025-03-04 03:57:10,708 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-03-04 03:57:10,709 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 0 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5972 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-03-04 03:57:10,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5972 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-04 03:57:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2025-03-04 03:57:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3070 states have (on average 1.2986970684039087) internal successors, (3987), 3126 states have internal predecessors, (3987), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-04 03:57:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6033 transitions. [2025-03-04 03:57:10,885 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6033 transitions. Word has length 171 [2025-03-04 03:57:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6033 transitions. [2025-03-04 03:57:10,886 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-03-04 03:57:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6033 transitions. [2025-03-04 03:57:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 03:57:10,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:10,890 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-03-04 03:57:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:57:10,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -946110089, now seen corresponding path program 1 times [2025-03-04 03:57:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656037255] [2025-03-04 03:57:10,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:11,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 03:57:11,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 03:57:11,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:11,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 03:57:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656037255] [2025-03-04 03:57:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656037255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:11,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:11,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825795182] [2025-03-04 03:57:11,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:11,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:11,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:11,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:11,293 INFO L87 Difference]: Start difference. First operand 4259 states and 6033 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-03-04 03:57:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:11,472 INFO L93 Difference]: Finished difference Result 8543 states and 12107 transitions. [2025-03-04 03:57:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:11,472 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-03-04 03:57:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:11,494 INFO L225 Difference]: With dead ends: 8543 [2025-03-04 03:57:11,494 INFO L226 Difference]: Without dead ends: 4287 [2025-03-04 03:57:11,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-03-04 03:57:11,510 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 4 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2989 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-03-04 03:57:11,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2989 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2025-03-04 03:57:11,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 4263. [2025-03-04 03:57:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3074 states have (on average 1.2983083929733246) internal successors, (3991), 3130 states have internal predecessors, (3991), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-04 03:57:11,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6037 transitions. [2025-03-04 03:57:11,677 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6037 transitions. Word has length 180 [2025-03-04 03:57:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:11,677 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 6037 transitions. [2025-03-04 03:57:11,678 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-03-04 03:57:11,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6037 transitions. [2025-03-04 03:57:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 03:57:11,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:11,680 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-03-04 03:57:11,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:57:11,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash -252602460, now seen corresponding path program 1 times [2025-03-04 03:57:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074385574] [2025-03-04 03:57:11,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:11,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:11,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 03:57:11,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 03:57:11,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:11,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-04 03:57:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074385574] [2025-03-04 03:57:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074385574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018120594] [2025-03-04 03:57:12,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:12,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:12,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:12,092 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:12,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 03:57:12,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 03:57:12,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 03:57:12,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:12,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:12,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:57:12,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 03:57:13,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:57:13,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018120594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:13,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:57:13,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:57:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88354885] [2025-03-04 03:57:13,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:13,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:13,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:13,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:13,019 INFO L87 Difference]: Start difference. First operand 4263 states and 6037 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-03-04 03:57:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:13,565 INFO L93 Difference]: Finished difference Result 8539 states and 12111 transitions. [2025-03-04 03:57:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:13,566 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-03-04 03:57:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:13,587 INFO L225 Difference]: With dead ends: 8539 [2025-03-04 03:57:13,588 INFO L226 Difference]: Without dead ends: 4279 [2025-03-04 03:57:13,603 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-03-04 03:57:13,604 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 4 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2987 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:13,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2987 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:57:13,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2025-03-04 03:57:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4267. [2025-03-04 03:57:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3078 states have (on average 1.297920727745289) internal successors, (3995), 3134 states have internal predecessors, (3995), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-04 03:57:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6041 transitions. [2025-03-04 03:57:13,759 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6041 transitions. Word has length 193 [2025-03-04 03:57:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:13,759 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 6041 transitions. [2025-03-04 03:57:13,759 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-03-04 03:57:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6041 transitions. [2025-03-04 03:57:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 03:57:13,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:13,763 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-03-04 03:57:13,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:57:13,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 03:57:13,970 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:13,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1597054548, now seen corresponding path program 1 times [2025-03-04 03:57:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:13,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045772106] [2025-03-04 03:57:13,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:13,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:14,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 03:57:14,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 03:57:14,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:14,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 03:57:14,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:14,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045772106] [2025-03-04 03:57:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045772106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:14,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975709152] [2025-03-04 03:57:14,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:14,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:14,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:57:15,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 03:57:15,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 03:57:15,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:15,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:15,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:57:15,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 03:57:15,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:57:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975709152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:57:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:57:15,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496905617] [2025-03-04 03:57:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:15,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:15,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:15,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:15,477 INFO L87 Difference]: Start difference. First operand 4267 states and 6041 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-03-04 03:57:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:15,641 INFO L93 Difference]: Finished difference Result 8539 states and 12107 transitions. [2025-03-04 03:57:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:15,642 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-03-04 03:57:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:15,664 INFO L225 Difference]: With dead ends: 8539 [2025-03-04 03:57:15,664 INFO L226 Difference]: Without dead ends: 4275 [2025-03-04 03:57:15,676 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-03-04 03:57:15,677 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 1 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2989 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:15,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2989 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-04 03:57:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4271. [2025-03-04 03:57:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3082 states have (on average 1.2975340687865022) internal successors, (3999), 3138 states have internal predecessors, (3999), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-04 03:57:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 6045 transitions. [2025-03-04 03:57:15,871 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 6045 transitions. Word has length 196 [2025-03-04 03:57:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:15,872 INFO L471 AbstractCegarLoop]: Abstraction has 4271 states and 6045 transitions. [2025-03-04 03:57:15,872 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-03-04 03:57:15,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 6045 transitions. [2025-03-04 03:57:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 03:57:15,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:15,875 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-03-04 03:57:15,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 03:57:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 03:57:16,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 594863977, now seen corresponding path program 1 times [2025-03-04 03:57:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604530659] [2025-03-04 03:57:16,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:16,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 03:57:16,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 03:57:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 03:57:16,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:16,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604530659] [2025-03-04 03:57:16,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604530659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:16,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507134731] [2025-03-04 03:57:16,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:16,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:16,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 03:57:17,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 03:57:17,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 03:57:17,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:17,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:17,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:17,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-04 03:57:17,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:57:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-04 03:57:17,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507134731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:57:17,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:57:17,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:57:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734170751] [2025-03-04 03:57:17,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:57:17,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:57:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:17,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:57:17,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:57:17,760 INFO L87 Difference]: Start difference. First operand 4271 states and 6045 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-03-04 03:57:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:18,031 INFO L93 Difference]: Finished difference Result 8627 states and 12223 transitions. [2025-03-04 03:57:18,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:18,032 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-03-04 03:57:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:18,056 INFO L225 Difference]: With dead ends: 8627 [2025-03-04 03:57:18,056 INFO L226 Difference]: Without dead ends: 4359 [2025-03-04 03:57:18,068 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-03-04 03:57:18,069 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 22 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:18,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2996 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2025-03-04 03:57:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4319. [2025-03-04 03:57:18,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 3118 states have (on average 1.2979474021808852) internal successors, (4047), 3174 states have internal predecessors, (4047), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1065), 966 states have call predecessors, (1065), 993 states have call successors, (1065) [2025-03-04 03:57:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 6117 transitions. [2025-03-04 03:57:18,234 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 6117 transitions. Word has length 198 [2025-03-04 03:57:18,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:18,236 INFO L471 AbstractCegarLoop]: Abstraction has 4319 states and 6117 transitions. [2025-03-04 03:57:18,236 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-03-04 03:57:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 6117 transitions. [2025-03-04 03:57:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 03:57:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:18,240 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-03-04 03:57:18,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 03:57:18,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:18,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -271165642, now seen corresponding path program 2 times [2025-03-04 03:57:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8307199] [2025-03-04 03:57:18,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:57:18,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:18,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-03-04 03:57:18,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 237 statements. [2025-03-04 03:57:18,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:57:18,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-04 03:57:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8307199] [2025-03-04 03:57:18,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8307199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:18,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:18,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:18,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938651447] [2025-03-04 03:57:18,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:18,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:18,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:18,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:18,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:18,830 INFO L87 Difference]: Start difference. First operand 4319 states and 6117 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-03-04 03:57:22,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:57:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:23,194 INFO L93 Difference]: Finished difference Result 8647 states and 12266 transitions. [2025-03-04 03:57:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:23,195 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-03-04 03:57:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:23,222 INFO L225 Difference]: With dead ends: 8647 [2025-03-04 03:57:23,222 INFO L226 Difference]: Without dead ends: 4331 [2025-03-04 03:57:23,239 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-03-04 03:57:23,241 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 1470 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:23,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 4389 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 03:57:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2025-03-04 03:57:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4317. [2025-03-04 03:57:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3116 states have (on average 1.2968549422336328) internal successors, (4041), 3173 states have internal predecessors, (4041), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1041), 965 states have call predecessors, (1041), 993 states have call successors, (1041) [2025-03-04 03:57:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6087 transitions. [2025-03-04 03:57:23,431 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6087 transitions. Word has length 237 [2025-03-04 03:57:23,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:23,431 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 6087 transitions. [2025-03-04 03:57:23,432 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-03-04 03:57:23,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6087 transitions. [2025-03-04 03:57:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 03:57:23,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:23,436 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-03-04 03:57:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:57:23,437 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:23,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2076603976, now seen corresponding path program 1 times [2025-03-04 03:57:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:23,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141624912] [2025-03-04 03:57:23,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:23,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 03:57:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 03:57:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:23,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:23,924 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 03:57:23,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141624912] [2025-03-04 03:57:23,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141624912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:23,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132148077] [2025-03-04 03:57:23,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:23,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:23,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:23,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:23,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 03:57:24,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 03:57:24,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 03:57:24,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:24,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:24,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 2810 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:24,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-04 03:57:24,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:57:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-04 03:57:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132148077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:57:25,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:57:25,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:57:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168817752] [2025-03-04 03:57:25,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:57:25,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:57:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:25,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:57:25,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:57:25,127 INFO L87 Difference]: Start difference. First operand 4317 states and 6087 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-03-04 03:57:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:25,312 INFO L93 Difference]: Finished difference Result 8655 states and 12223 transitions. [2025-03-04 03:57:25,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:25,313 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-03-04 03:57:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:25,333 INFO L225 Difference]: With dead ends: 8655 [2025-03-04 03:57:25,333 INFO L226 Difference]: Without dead ends: 4341 [2025-03-04 03:57:25,343 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-03-04 03:57:25,344 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 2 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:25,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2989 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2025-03-04 03:57:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4341. [2025-03-04 03:57:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4341 states, 3140 states have (on average 1.2945859872611465) internal successors, (4065), 3197 states have internal predecessors, (4065), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1041), 965 states have call predecessors, (1041), 993 states have call successors, (1041) [2025-03-04 03:57:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 6111 transitions. [2025-03-04 03:57:25,498 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 6111 transitions. Word has length 237 [2025-03-04 03:57:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:25,500 INFO L471 AbstractCegarLoop]: Abstraction has 4341 states and 6111 transitions. [2025-03-04 03:57:25,501 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-03-04 03:57:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 6111 transitions. [2025-03-04 03:57:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-04 03:57:25,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:25,504 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-03-04 03:57:25,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 03:57:25,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:25,706 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:25,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1534187089, now seen corresponding path program 2 times [2025-03-04 03:57:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988985805] [2025-03-04 03:57:25,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:57:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:25,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-03-04 03:57:25,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 243 statements. [2025-03-04 03:57:25,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:57:25,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 03:57:26,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:26,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988985805] [2025-03-04 03:57:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988985805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:57:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551805803] [2025-03-04 03:57:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:26,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:57:26,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:26,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:57:26,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:26,090 INFO L87 Difference]: Start difference. First operand 4341 states and 6111 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-03-04 03:57:26,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:26,263 INFO L93 Difference]: Finished difference Result 4365 states and 6132 transitions. [2025-03-04 03:57:26,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:57:26,263 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-03-04 03:57:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:26,283 INFO L225 Difference]: With dead ends: 4365 [2025-03-04 03:57:26,284 INFO L226 Difference]: Without dead ends: 4259 [2025-03-04 03:57:26,288 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-03-04 03:57:26,288 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 1 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5978 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-03-04 03:57:26,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5978 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-04 03:57:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2025-03-04 03:57:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3086 states have (on average 1.2926117952041478) internal successors, (3989), 3137 states have internal predecessors, (3989), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-04 03:57:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 5983 transitions. [2025-03-04 03:57:26,427 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 5983 transitions. Word has length 243 [2025-03-04 03:57:26,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:26,429 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 5983 transitions. [2025-03-04 03:57:26,429 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-03-04 03:57:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 5983 transitions. [2025-03-04 03:57:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-04 03:57:26,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:26,435 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-03-04 03:57:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 03:57:26,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:26,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash -892716651, now seen corresponding path program 1 times [2025-03-04 03:57:26,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:26,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254933720] [2025-03-04 03:57:26,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:26,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-04 03:57:26,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-04 03:57:26,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:26,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 03:57:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254933720] [2025-03-04 03:57:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254933720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:26,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:26,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:26,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13365677] [2025-03-04 03:57:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:26,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:26,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:26,768 INFO L87 Difference]: Start difference. First operand 4259 states and 5983 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-03-04 03:57:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:26,899 INFO L93 Difference]: Finished difference Result 8531 states and 11995 transitions. [2025-03-04 03:57:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:26,900 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-03-04 03:57:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:26,923 INFO L225 Difference]: With dead ends: 8531 [2025-03-04 03:57:26,923 INFO L226 Difference]: Without dead ends: 4275 [2025-03-04 03:57:26,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:26,934 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2983 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-03-04 03:57:26,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2983 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-04 03:57:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4263. [2025-03-04 03:57:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3090 states have (on average 1.2922330097087378) internal successors, (3993), 3141 states have internal predecessors, (3993), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-04 03:57:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5987 transitions. [2025-03-04 03:57:27,065 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5987 transitions. Word has length 261 [2025-03-04 03:57:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:27,065 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5987 transitions. [2025-03-04 03:57:27,065 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-03-04 03:57:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5987 transitions. [2025-03-04 03:57:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-04 03:57:27,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:27,069 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-03-04 03:57:27,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 03:57:27,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1827817539, now seen corresponding path program 1 times [2025-03-04 03:57:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567114530] [2025-03-04 03:57:27,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:27,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-04 03:57:27,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-04 03:57:27,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:27,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-04 03:57:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567114530] [2025-03-04 03:57:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567114530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133345780] [2025-03-04 03:57:27,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:27,472 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:27,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 03:57:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-04 03:57:28,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-04 03:57:28,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:28,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:28,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 2772 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:57:28,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 03:57:28,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:57:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133345780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:57:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:57:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120435896] [2025-03-04 03:57:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:28,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:28,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:28,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:28,665 INFO L87 Difference]: Start difference. First operand 4263 states and 5987 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-03-04 03:57:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:28,829 INFO L93 Difference]: Finished difference Result 8539 states and 12011 transitions. [2025-03-04 03:57:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:28,830 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-03-04 03:57:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:28,855 INFO L225 Difference]: With dead ends: 8539 [2025-03-04 03:57:28,855 INFO L226 Difference]: Without dead ends: 4279 [2025-03-04 03:57:28,868 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-03-04 03:57:28,869 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2983 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-03-04 03:57:28,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2983 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2025-03-04 03:57:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4267. [2025-03-04 03:57:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3094 states have (on average 1.2918552036199096) internal successors, (3997), 3145 states have internal predecessors, (3997), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-04 03:57:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5991 transitions. [2025-03-04 03:57:29,014 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5991 transitions. Word has length 268 [2025-03-04 03:57:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:29,015 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 5991 transitions. [2025-03-04 03:57:29,015 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-03-04 03:57:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5991 transitions. [2025-03-04 03:57:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-04 03:57:29,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:29,021 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-03-04 03:57:29,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 03:57:29,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 03:57:29,222 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1847774947, now seen corresponding path program 1 times [2025-03-04 03:57:29,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:29,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050052949] [2025-03-04 03:57:29,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:29,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:29,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:57:29,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:57:29,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:29,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-04 03:57:29,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050052949] [2025-03-04 03:57:29,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050052949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:29,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088981217] [2025-03-04 03:57:29,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:29,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:29,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:29,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:29,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 03:57:30,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-04 03:57:30,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-04 03:57:30,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:30,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:30,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:30,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 03:57:30,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:57:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-04 03:57:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088981217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:57:30,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:57:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:57:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344033454] [2025-03-04 03:57:30,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:57:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:57:30,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:30,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:57:30,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:57:30,965 INFO L87 Difference]: Start difference. First operand 4267 states and 5991 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-03-04 03:57:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:31,121 INFO L93 Difference]: Finished difference Result 8579 states and 12059 transitions. [2025-03-04 03:57:31,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:31,121 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-03-04 03:57:31,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:31,139 INFO L225 Difference]: With dead ends: 8579 [2025-03-04 03:57:31,139 INFO L226 Difference]: Without dead ends: 4315 [2025-03-04 03:57:31,148 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-03-04 03:57:31,148 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 4 mSDsluCounter, 5956 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:31,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7449 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2025-03-04 03:57:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4315. [2025-03-04 03:57:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4315 states, 3130 states have (on average 1.2884984025559105) internal successors, (4033), 3181 states have internal predecessors, (4033), 989 states have call successors, (989), 197 states have call predecessors, (989), 195 states have return successors, (1029), 956 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-03-04 03:57:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 6051 transitions. [2025-03-04 03:57:31,356 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 6051 transitions. Word has length 275 [2025-03-04 03:57:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:31,356 INFO L471 AbstractCegarLoop]: Abstraction has 4315 states and 6051 transitions. [2025-03-04 03:57:31,357 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-03-04 03:57:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 6051 transitions. [2025-03-04 03:57:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 03:57:31,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:31,363 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-03-04 03:57:31,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 03:57:31,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 03:57:31,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:31,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1344479477, now seen corresponding path program 2 times [2025-03-04 03:57:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:31,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675574024] [2025-03-04 03:57:31,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:57:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:31,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-03-04 03:57:31,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 296 statements. [2025-03-04 03:57:31,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:57:31,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2025-03-04 03:57:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675574024] [2025-03-04 03:57:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675574024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:31,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:31,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71746188] [2025-03-04 03:57:31,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:31,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:31,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:31,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:31,788 INFO L87 Difference]: Start difference. First operand 4315 states and 6051 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-03-04 03:57:33,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:57:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:34,075 INFO L93 Difference]: Finished difference Result 8632 states and 12103 transitions. [2025-03-04 03:57:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:34,075 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-03-04 03:57:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:34,102 INFO L225 Difference]: With dead ends: 8632 [2025-03-04 03:57:34,102 INFO L226 Difference]: Without dead ends: 4320 [2025-03-04 03:57:34,114 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-03-04 03:57:34,114 INFO L435 NwaCegarLoop]: 2886 mSDtfsCounter, 1473 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 4370 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:34,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 4370 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 03:57:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2025-03-04 03:57:34,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 4302. [2025-03-04 03:57:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 3119 states have (on average 1.2879127925617184) internal successors, (4017), 3172 states have internal predecessors, (4017), 987 states have call successors, (987), 196 states have call predecessors, (987), 195 states have return successors, (1005), 953 states have call predecessors, (1005), 969 states have call successors, (1005) [2025-03-04 03:57:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 6009 transitions. [2025-03-04 03:57:34,263 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 6009 transitions. Word has length 296 [2025-03-04 03:57:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:34,264 INFO L471 AbstractCegarLoop]: Abstraction has 4302 states and 6009 transitions. [2025-03-04 03:57:34,264 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-03-04 03:57:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 6009 transitions. [2025-03-04 03:57:34,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-04 03:57:34,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:34,270 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-03-04 03:57:34,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 03:57:34,271 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:34,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:34,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1637882484, now seen corresponding path program 1 times [2025-03-04 03:57:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794060683] [2025-03-04 03:57:34,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:34,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 03:57:34,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 03:57:34,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:34,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 03:57:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:34,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794060683] [2025-03-04 03:57:34,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794060683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:34,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340479244] [2025-03-04 03:57:34,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:34,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:34,639 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:34,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 03:57:35,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-04 03:57:35,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-04 03:57:35,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:35,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:35,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:35,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-04 03:57:35,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:57:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 03:57:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340479244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:57:35,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:57:35,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:57:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404052049] [2025-03-04 03:57:35,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:57:35,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:57:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:35,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:57:35,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:57:35,962 INFO L87 Difference]: Start difference. First operand 4302 states and 6009 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-03-04 03:57:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:36,101 INFO L93 Difference]: Finished difference Result 8649 states and 12103 transitions. [2025-03-04 03:57:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:36,102 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-03-04 03:57:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:36,120 INFO L225 Difference]: With dead ends: 8649 [2025-03-04 03:57:36,120 INFO L226 Difference]: Without dead ends: 4350 [2025-03-04 03:57:36,130 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-03-04 03:57:36,130 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 4 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4471 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:36,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4471 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:36,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2025-03-04 03:57:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4350. [2025-03-04 03:57:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 3155 states have (on average 1.2846275752773375) internal successors, (4053), 3208 states have internal predecessors, (4053), 999 states have call successors, (999), 196 states have call predecessors, (999), 195 states have return successors, (1017), 965 states have call predecessors, (1017), 981 states have call successors, (1017) [2025-03-04 03:57:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 6069 transitions. [2025-03-04 03:57:36,369 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 6069 transitions. Word has length 296 [2025-03-04 03:57:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 4350 states and 6069 transitions. [2025-03-04 03:57:36,371 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-03-04 03:57:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 6069 transitions. [2025-03-04 03:57:36,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-04 03:57:36,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:36,377 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-03-04 03:57:36,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 03:57:36,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:36,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:36,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash 240574230, now seen corresponding path program 2 times [2025-03-04 03:57:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:36,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141798125] [2025-03-04 03:57:36,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 03:57:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:36,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-03-04 03:57:36,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 317 statements. [2025-03-04 03:57:36,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 03:57:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 03:57:36,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:36,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141798125] [2025-03-04 03:57:36,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141798125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:57:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093088711] [2025-03-04 03:57:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:36,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:57:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:36,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:57:36,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:57:36,916 INFO L87 Difference]: Start difference. First operand 4350 states and 6069 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-03-04 03:57:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:37,151 INFO L93 Difference]: Finished difference Result 4361 states and 6077 transitions. [2025-03-04 03:57:37,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:37,151 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-03-04 03:57:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:37,173 INFO L225 Difference]: With dead ends: 4361 [2025-03-04 03:57:37,173 INFO L226 Difference]: Without dead ends: 4338 [2025-03-04 03:57:37,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:57:37,176 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 0 mSDsluCounter, 5982 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7481 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-03-04 03:57:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7481 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2025-03-04 03:57:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2025-03-04 03:57:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3146 states have (on average 1.2835346471710107) internal successors, (4038), 3198 states have internal predecessors, (4038), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-04 03:57:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6049 transitions. [2025-03-04 03:57:37,312 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6049 transitions. Word has length 317 [2025-03-04 03:57:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:37,313 INFO L471 AbstractCegarLoop]: Abstraction has 4338 states and 6049 transitions. [2025-03-04 03:57:37,313 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-03-04 03:57:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6049 transitions. [2025-03-04 03:57:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 03:57:37,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:37,319 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-03-04 03:57:37,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 03:57:37,319 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 618137173, now seen corresponding path program 1 times [2025-03-04 03:57:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912637643] [2025-03-04 03:57:37,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:37,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:37,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 03:57:37,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 03:57:37,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:37,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:37,696 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 03:57:37,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912637643] [2025-03-04 03:57:37,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912637643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:37,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086665457] [2025-03-04 03:57:37,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:37,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:37,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:37,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 03:57:38,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 03:57:38,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 03:57:38,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:38,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:38,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:38,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-03-04 03:57:39,006 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:57:39,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086665457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:39,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:57:39,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-04 03:57:39,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920096531] [2025-03-04 03:57:39,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:39,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:39,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:39,007 INFO L87 Difference]: Start difference. First operand 4338 states and 6049 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-03-04 03:57:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:39,181 INFO L93 Difference]: Finished difference Result 8681 states and 12107 transitions. [2025-03-04 03:57:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:39,181 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-03-04 03:57:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:39,206 INFO L225 Difference]: With dead ends: 8681 [2025-03-04 03:57:39,206 INFO L226 Difference]: Without dead ends: 4346 [2025-03-04 03:57:39,218 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-03-04 03:57:39,219 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 0 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2979 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:39,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2979 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2025-03-04 03:57:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2025-03-04 03:57:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 3154 states have (on average 1.2828154724159797) internal successors, (4046), 3206 states have internal predecessors, (4046), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-04 03:57:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6057 transitions. [2025-03-04 03:57:39,359 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6057 transitions. Word has length 311 [2025-03-04 03:57:39,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:39,360 INFO L471 AbstractCegarLoop]: Abstraction has 4346 states and 6057 transitions. [2025-03-04 03:57:39,360 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-03-04 03:57:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6057 transitions. [2025-03-04 03:57:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-04 03:57:39,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:39,366 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-03-04 03:57:39,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 03:57:39,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 03:57:39,567 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:39,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash 898487062, now seen corresponding path program 1 times [2025-03-04 03:57:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:39,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127948831] [2025-03-04 03:57:39,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:39,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 03:57:39,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 03:57:39,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:39,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 03:57:39,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:39,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127948831] [2025-03-04 03:57:39,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127948831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:57:39,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262362792] [2025-03-04 03:57:39,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:39,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:57:39,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:57:39,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 03:57:40,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-04 03:57:41,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-04 03:57:41,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:41,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:41,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:57:41,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:57:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-04 03:57:41,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 03:57:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 03:57:41,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262362792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 03:57:41,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 03:57:41,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 03:57:41,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204473853] [2025-03-04 03:57:41,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 03:57:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:57:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:41,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:57:41,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:57:41,368 INFO L87 Difference]: Start difference. First operand 4346 states and 6057 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-03-04 03:57:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:42,353 INFO L93 Difference]: Finished difference Result 8821 states and 12279 transitions. [2025-03-04 03:57:42,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:42,354 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-03-04 03:57:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:42,388 INFO L225 Difference]: With dead ends: 8821 [2025-03-04 03:57:42,388 INFO L226 Difference]: Without dead ends: 4478 [2025-03-04 03:57:42,408 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-03-04 03:57:42,410 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 8 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:57:42,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5963 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:57:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-03-04 03:57:42,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4478. [2025-03-04 03:57:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4478 states, 3286 states have (on average 1.2751065124771759) internal successors, (4190), 3338 states have internal predecessors, (4190), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-04 03:57:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6201 transitions. [2025-03-04 03:57:42,592 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6201 transitions. Word has length 311 [2025-03-04 03:57:42,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:42,592 INFO L471 AbstractCegarLoop]: Abstraction has 4478 states and 6201 transitions. [2025-03-04 03:57:42,592 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-03-04 03:57:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6201 transitions. [2025-03-04 03:57:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-04 03:57:42,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:42,598 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-03-04 03:57:42,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 03:57:42,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:57:42,799 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:42,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:42,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1247948669, now seen corresponding path program 1 times [2025-03-04 03:57:42,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993766676] [2025-03-04 03:57:42,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:42,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-04 03:57:42,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-04 03:57:42,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:42,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 03:57:43,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:43,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993766676] [2025-03-04 03:57:43,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993766676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:43,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:57:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141059794] [2025-03-04 03:57:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:43,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:57:43,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:43,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:57:43,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:43,082 INFO L87 Difference]: Start difference. First operand 4478 states and 6201 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-03-04 03:57:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:43,293 INFO L93 Difference]: Finished difference Result 8949 states and 12395 transitions. [2025-03-04 03:57:43,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:57:43,294 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-03-04 03:57:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:43,319 INFO L225 Difference]: With dead ends: 8949 [2025-03-04 03:57:43,320 INFO L226 Difference]: Without dead ends: 4474 [2025-03-04 03:57:43,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:57:43,330 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 0 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2973 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-03-04 03:57:43,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2973 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 03:57:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2025-03-04 03:57:43,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4474. [2025-03-04 03:57:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3282 states have (on average 1.2742230347349177) internal successors, (4182), 3330 states have internal predecessors, (4182), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-04 03:57:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6193 transitions. [2025-03-04 03:57:43,463 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6193 transitions. Word has length 340 [2025-03-04 03:57:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:43,464 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 6193 transitions. [2025-03-04 03:57:43,464 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-03-04 03:57:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6193 transitions. [2025-03-04 03:57:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-04 03:57:43,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:43,470 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-03-04 03:57:43,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 03:57:43,470 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:43,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 150675314, now seen corresponding path program 1 times [2025-03-04 03:57:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:43,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670115995] [2025-03-04 03:57:43,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:43,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:43,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-04 03:57:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-04 03:57:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 03:57:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670115995] [2025-03-04 03:57:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670115995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:57:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32935221] [2025-03-04 03:57:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:57:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:57:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:57:43,911 INFO L87 Difference]: Start difference. First operand 4474 states and 6193 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-03-04 03:57:44,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:44,102 INFO L93 Difference]: Finished difference Result 6617 states and 9164 transitions. [2025-03-04 03:57:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:57:44,103 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-03-04 03:57:44,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:44,131 INFO L225 Difference]: With dead ends: 6617 [2025-03-04 03:57:44,131 INFO L226 Difference]: Without dead ends: 4462 [2025-03-04 03:57:44,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:57:44,139 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 0 mSDsluCounter, 5958 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7449 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-03-04 03:57:44,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7449 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2025-03-04 03:57:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4462. [2025-03-04 03:57:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4462 states, 3272 states have (on average 1.2744498777506112) internal successors, (4170), 3322 states have internal predecessors, (4170), 996 states have call successors, (996), 196 states have call predecessors, (996), 193 states have return successors, (1011), 959 states have call predecessors, (1011), 979 states have call successors, (1011) [2025-03-04 03:57:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6177 transitions. [2025-03-04 03:57:44,288 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6177 transitions. Word has length 357 [2025-03-04 03:57:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:44,289 INFO L471 AbstractCegarLoop]: Abstraction has 4462 states and 6177 transitions. [2025-03-04 03:57:44,289 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-03-04 03:57:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6177 transitions. [2025-03-04 03:57:44,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-04 03:57:44,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:44,295 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-03-04 03:57:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 03:57:44,295 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:44,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1564085318, now seen corresponding path program 1 times [2025-03-04 03:57:44,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:44,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580005537] [2025-03-04 03:57:44,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:44,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-04 03:57:44,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-04 03:57:44,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:44,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-04 03:57:44,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:44,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580005537] [2025-03-04 03:57:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580005537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:44,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:44,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:57:44,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432871861] [2025-03-04 03:57:44,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:44,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:57:44,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:44,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:57:44,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:44,976 INFO L87 Difference]: Start difference. First operand 4462 states and 6177 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-03-04 03:57:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:57:45,205 INFO L93 Difference]: Finished difference Result 4507 states and 6219 transitions. [2025-03-04 03:57:45,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:57:45,206 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-03-04 03:57:45,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:57:45,225 INFO L225 Difference]: With dead ends: 4507 [2025-03-04 03:57:45,226 INFO L226 Difference]: Without dead ends: 2330 [2025-03-04 03:57:45,231 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-03-04 03:57:45,231 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 0 mSDsluCounter, 4437 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5921 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-03-04 03:57:45,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5921 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 03:57:45,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-04 03:57:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2025-03-04 03:57:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1704 states have (on average 1.2705399061032865) internal successors, (2165), 1728 states have internal predecessors, (2165), 521 states have call successors, (521), 107 states have call predecessors, (521), 104 states have return successors, (514), 502 states have call predecessors, (514), 510 states have call successors, (514) [2025-03-04 03:57:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3200 transitions. [2025-03-04 03:57:45,311 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3200 transitions. Word has length 380 [2025-03-04 03:57:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:57:45,312 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3200 transitions. [2025-03-04 03:57:45,312 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-03-04 03:57:45,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3200 transitions. [2025-03-04 03:57:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-04 03:57:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:57:45,317 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-03-04 03:57:45,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 03:57:45,318 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:57:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:57:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash -120388857, now seen corresponding path program 1 times [2025-03-04 03:57:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:57:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400689194] [2025-03-04 03:57:45,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:57:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:57:45,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-04 03:57:45,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-04 03:57:45,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:57:45,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:57:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-04 03:57:45,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:57:45,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400689194] [2025-03-04 03:57:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400689194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:57:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:57:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:57:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115838909] [2025-03-04 03:57:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:57:45,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:57:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:57:45,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:57:45,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:57:45,888 INFO L87 Difference]: Start difference. First operand 2330 states and 3200 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-03-04 03:57:49,964 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 []