./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-8fc3dc6-m [2025-03-17 08:15:40,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:15:40,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:15:40,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:15:40,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:15:40,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:15:40,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:15:40,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:15:40,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:15:40,287 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:15:40,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:15:40,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:15:40,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:15:40,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:15:40,289 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:15:40,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:15:40,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:15:40,290 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:15:40,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:15:40,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:15:40,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:15:40,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:15:40,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:15:40,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:15:40,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:15:40,292 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-17 08:15:40,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:15:40,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:15:40,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:15:40,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:15:40,525 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:15:40,526 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-17 08:15:41,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f61b526/364e7f845e1f49f18abf2ec3f52802e0/FLAG8b4c8fbdc [2025-03-17 08:15:42,138 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:15:42,139 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-17 08:15:42,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f61b526/364e7f845e1f49f18abf2ec3f52802e0/FLAG8b4c8fbdc [2025-03-17 08:15:42,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f61b526/364e7f845e1f49f18abf2ec3f52802e0 [2025-03-17 08:15:42,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:15:42,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:15:42,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:15:42,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:15:42,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:15:42,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:15:42" (1/1) ... [2025-03-17 08:15:42,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac688c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:42, skipping insertion in model container [2025-03-17 08:15:42,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:15:42" (1/1) ... [2025-03-17 08:15:42,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:15:43,795 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-17 08:15:43,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:15:43,931 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:15:44,065 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-17 08:15:44,067 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-17 08:15:44,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [6119] [2025-03-17 08:15:44,070 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-17 08:15:44,070 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-17 08:15:44,201 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-17 08:15:44,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:15:44,258 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:15:44,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44 WrapperNode [2025-03-17 08:15:44,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:15:44,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:15:44,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:15:44,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:15:44,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,470 INFO L138 Inliner]: procedures = 216, calls = 1507, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3386 [2025-03-17 08:15:44,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:15:44,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:15:44,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:15:44,472 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:15:44,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,777 INFO L175 MemorySlicer]: Split 587 memory accesses to 18 slices as follows [2, 110, 3, 1, 1, 8, 415, 8, 2, 1, 3, 2, 8, 4, 5, 8, 1, 5]. 71 percent of accesses are in the largest equivalence class. The 129 initializations are split as follows [2, 110, 0, 0, 0, 0, 0, 8, 0, 1, 0, 0, 8, 0, 0, 0, 0, 0]. The 239 writes are split as follows [0, 0, 2, 0, 0, 1, 231, 0, 0, 0, 1, 0, 0, 2, 0, 2, 0, 0]. [2025-03-17 08:15:44,777 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,777 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:15:44,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:15:44,911 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:15:44,911 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:15:44,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (1/1) ... [2025-03-17 08:15:44,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:15:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:15:44,961 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-17 08:15:44,965 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-17 08:15:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-17 08:15:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-17 08:15:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2025-03-17 08:15:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2025-03-17 08:15:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-17 08:15:44,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:15:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-17 08:15:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-17 08:15:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:15:44,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:15:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:15:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:15:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 08:15:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-17 08:15:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-17 08:15:44,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-17 08:15:44,989 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-17 08:15:44,989 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 08:15:44,989 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-17 08:15:44,989 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-17 08:15:44,989 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-17 08:15:44,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2025-03-17 08:15:44,990 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-17 08:15:44,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-17 08:15:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-17 08:15:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-17 08:15:44,991 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-17 08:15:44,991 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-17 08:15:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-17 08:15:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-17 08:15:44,992 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-17 08:15:44,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-17 08:15:44,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-17 08:15:44,993 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-17 08:15:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 08:15:44,994 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-17 08:15:44,994 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-17 08:15:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 08:15:44,996 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 08:15:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-17 08:15:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2025-03-17 08:15:44,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-17 08:15:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-17 08:15:44,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 08:15:44,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-17 08:15:44,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:15:44,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:15:45,586 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:15:45,588 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:15:45,865 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6195: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-17 08:15:45,953 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9401: havoc #t~nondet880; [2025-03-17 08:15:46,084 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9397: havoc #t~nondet879; [2025-03-17 08:15:46,087 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc #t~nondet866; [2025-03-17 08:15:46,095 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6257: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-17 08:15:46,134 INFO L1322 $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-17 08:15:46,511 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9340: havoc #t~nondet869; [2025-03-17 08:15:46,513 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9351: havoc #t~nondet871; [2025-03-17 08:15:46,528 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-03-17 08:15:46,551 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc #t~bitwise1; [2025-03-17 08:15:46,553 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9244: havoc #t~nondet856; [2025-03-17 08:15:46,557 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9264: havoc dev_set_drvdata_#t~nondet859#1; [2025-03-17 08:15:46,593 INFO L1322 $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-17 08:15:46,596 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9380: havoc #t~ret877.base, #t~ret877.offset; [2025-03-17 08:15:46,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: havoc #t~mem65.base, #t~mem65.offset; [2025-03-17 08:15:46,613 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9384: havoc #t~nondet878; [2025-03-17 08:15:46,623 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc #t~mem137;havoc #t~bitwise138; [2025-03-17 08:15:46,717 INFO L1322 $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-17 08:15:46,717 INFO L1322 $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-17 08:15:47,048 INFO L1322 $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-17 08:15:54,801 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6510: havoc input_allocate_device_#t~ret146#1.base, input_allocate_device_#t~ret146#1.offset; [2025-03-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9289: havoc dvb_net_init_#t~nondet863#1; [2025-03-17 08:15:54,802 INFO L1322 $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-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc request_firmware_#t~nondet872#1; [2025-03-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9362: havoc strlcat_#t~nondet873#1; [2025-03-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9296: havoc dvb_register_adapter_#t~nondet864#1; [2025-03-17 08:15:54,802 INFO L1322 $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-17 08:15:54,802 INFO L1322 $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-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9300: havoc dvb_register_frontend_#t~nondet865#1; [2025-03-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9371: havoc ttusbdecfe_dvbs_attach_#t~ret874#1.base, ttusbdecfe_dvbs_attach_#t~ret874#1.offset; [2025-03-17 08:15:54,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9308: havoc dvb_unregister_frontend_#t~nondet867#1; [2025-03-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9374: havoc ttusbdecfe_dvbt_attach_#t~ret875#1.base, ttusbdecfe_dvbt_attach_#t~ret875#1.offset; [2025-03-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9377: havoc usb_alloc_coherent_#t~ret876#1.base, usb_alloc_coherent_#t~ret876#1.offset; [2025-03-17 08:15:54,803 INFO L1322 $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-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc crc32_le_#t~nondet857#1; [2025-03-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9318: havoc input_register_device_#t~nondet868#1; [2025-03-17 08:15:54,803 INFO L1322 $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-17 08:15:54,803 INFO L1322 $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-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260: havoc dev_get_drvdata_#t~ret858#1.base, dev_get_drvdata_#t~ret858#1.offset; [2025-03-17 08:15:54,803 INFO L1322 $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-17 08:15:54,803 INFO L1322 $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-17 08:15:54,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9268: havoc dvb_dmx_init_#t~nondet860#1; [2025-03-17 08:15:54,803 INFO L1322 $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-17 08:15:54,804 INFO L1322 $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-17 08:15:54,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc dvb_dmxdev_init_#t~nondet861#1; [2025-03-17 08:15:54,804 INFO L1322 $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-17 08:15:54,804 INFO L1322 $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-17 08:15:54,804 INFO L1322 $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-17 08:15:55,110 INFO L? ?]: Removed 1403 outVars from TransFormulas that were not future-live. [2025-03-17 08:15:55,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:15:55,153 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:15:55,153 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 08:15:55,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:15:55 BoogieIcfgContainer [2025-03-17 08:15:55,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:15:55,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:15:55,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:15:55,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:15:55,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:15:42" (1/3) ... [2025-03-17 08:15:55,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfb7082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:15:55, skipping insertion in model container [2025-03-17 08:15:55,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:15:44" (2/3) ... [2025-03-17 08:15:55,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dfb7082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:15:55, skipping insertion in model container [2025-03-17 08:15:55,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:15:55" (3/3) ... [2025-03-17 08:15:55,163 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-17 08:15:55,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:15:55,174 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, 1177 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-03-17 08:15:55,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:15:55,272 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;@4fc3afce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:15:55,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:15:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 1092 states, 768 states have (on average 1.3372395833333333) internal successors, (1027), 788 states have internal predecessors, (1027), 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-17 08:15:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 08:15:55,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:55,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:55,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:55,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:55,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1120453884, now seen corresponding path program 1 times [2025-03-17 08:15:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:55,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500995238] [2025-03-17 08:15:55,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:55,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:55,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 08:15:55,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 08:15:55,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:55,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:55,832 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-17 08:15:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:55,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500995238] [2025-03-17 08:15:55,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500995238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:55,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 08:15:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538552540] [2025-03-17 08:15:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:55,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:55,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:55,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:55,861 INFO L87 Difference]: Start difference. First operand has 1092 states, 768 states have (on average 1.3372395833333333) internal successors, (1027), 788 states have internal predecessors, (1027), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 08:15:56,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:56,198 INFO L93 Difference]: Finished difference Result 3248 states and 4764 transitions. [2025-03-17 08:15:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2025-03-17 08:15:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:56,230 INFO L225 Difference]: With dead ends: 3248 [2025-03-17 08:15:56,230 INFO L226 Difference]: Without dead ends: 2152 [2025-03-17 08:15:56,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 08:15:56,247 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1547 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:56,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 3124 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2025-03-17 08:15:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2147. [2025-03-17 08:15:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1516 states have (on average 1.324538258575198) internal successors, (2008), 1547 states have internal predecessors, (2008), 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-17 08:15:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 3071 transitions. [2025-03-17 08:15:56,456 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 3071 transitions. Word has length 7 [2025-03-17 08:15:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:56,457 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 3071 transitions. [2025-03-17 08:15:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 08:15:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 3071 transitions. [2025-03-17 08:15:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 08:15:56,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:56,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:56,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:15:56,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:56,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:56,459 INFO L85 PathProgramCache]: Analyzing trace with hash -375507817, now seen corresponding path program 1 times [2025-03-17 08:15:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792815081] [2025-03-17 08:15:56,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:56,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:56,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 08:15:56,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 08:15:56,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:56,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:56,746 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-17 08:15:56,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:56,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792815081] [2025-03-17 08:15:56,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792815081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:56,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:56,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 08:15:56,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641673875] [2025-03-17 08:15:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:56,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:56,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:56,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:56,749 INFO L87 Difference]: Start difference. First operand 2147 states and 3071 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 08:15:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:56,855 INFO L93 Difference]: Finished difference Result 2149 states and 3072 transitions. [2025-03-17 08:15:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:56,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2025-03-17 08:15:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:56,869 INFO L225 Difference]: With dead ends: 2149 [2025-03-17 08:15:56,869 INFO L226 Difference]: Without dead ends: 2146 [2025-03-17 08:15:56,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 08:15:56,872 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1540 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:56,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 1528 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:15:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-03-17 08:15:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2146. [2025-03-17 08:15:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1516 states have (on average 1.3238786279683377) internal successors, (2007), 1546 states have internal predecessors, (2007), 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-17 08:15:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3069 transitions. [2025-03-17 08:15:56,985 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3069 transitions. Word has length 8 [2025-03-17 08:15:56,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:56,985 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3069 transitions. [2025-03-17 08:15:56,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-17 08:15:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3069 transitions. [2025-03-17 08:15:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 08:15:56,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:56,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:56,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:15:56,986 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1242982757, now seen corresponding path program 1 times [2025-03-17 08:15:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602711218] [2025-03-17 08:15:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:57,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 08:15:57,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 08:15:57,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:57,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:57,235 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-17 08:15:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602711218] [2025-03-17 08:15:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602711218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 08:15:57,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460566846] [2025-03-17 08:15:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:57,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:57,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:57,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:57,237 INFO L87 Difference]: Start difference. First operand 2146 states and 3069 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 08:15:57,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:57,331 INFO L93 Difference]: Finished difference Result 2148 states and 3070 transitions. [2025-03-17 08:15:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 08:15:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:57,345 INFO L225 Difference]: With dead ends: 2148 [2025-03-17 08:15:57,345 INFO L226 Difference]: Without dead ends: 2145 [2025-03-17 08:15:57,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 08:15:57,347 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 1537 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:57,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1526 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:15:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2025-03-17 08:15:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2025-03-17 08:15:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1516 states have (on average 1.3232189973614776) internal successors, (2006), 1545 states have internal predecessors, (2006), 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-17 08:15:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3067 transitions. [2025-03-17 08:15:57,439 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3067 transitions. Word has length 9 [2025-03-17 08:15:57,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:57,439 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3067 transitions. [2025-03-17 08:15:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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-17 08:15:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3067 transitions. [2025-03-17 08:15:57,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-17 08:15:57,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:57,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:15:57,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:15:57,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:57,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -123418024, now seen corresponding path program 1 times [2025-03-17 08:15:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584464998] [2025-03-17 08:15:57,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:57,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 08:15:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 08:15:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:57,686 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-17 08:15:57,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584464998] [2025-03-17 08:15:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584464998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:57,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:57,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 08:15:57,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728601299] [2025-03-17 08:15:57,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:57,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:57,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:57,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:57,687 INFO L87 Difference]: Start difference. First operand 2145 states and 3067 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-17 08:15:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:57,926 INFO L93 Difference]: Finished difference Result 6394 states and 9253 transitions. [2025-03-17 08:15:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-17 08:15:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:57,952 INFO L225 Difference]: With dead ends: 6394 [2025-03-17 08:15:57,952 INFO L226 Difference]: Without dead ends: 4245 [2025-03-17 08:15:57,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 08:15:57,966 INFO L435 NwaCegarLoop]: 1583 mSDtfsCounter, 1542 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3080 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:57,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 3080 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4245 states. [2025-03-17 08:15:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4245 to 4223. [2025-03-17 08:15:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4223 states, 2993 states have (on average 1.324423655195456) internal successors, (3964), 3049 states have internal predecessors, (3964), 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-17 08:15:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4223 states to 4223 states and 6096 transitions. [2025-03-17 08:15:58,157 INFO L78 Accepts]: Start accepts. Automaton has 4223 states and 6096 transitions. Word has length 10 [2025-03-17 08:15:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:58,157 INFO L471 AbstractCegarLoop]: Abstraction has 4223 states and 6096 transitions. [2025-03-17 08:15:58,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 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-17 08:15:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4223 states and 6096 transitions. [2025-03-17 08:15:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-17 08:15:58,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:58,163 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] [2025-03-17 08:15:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:15:58,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1213545605, now seen corresponding path program 1 times [2025-03-17 08:15:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376206660] [2025-03-17 08:15:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:58,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-17 08:15:58,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-17 08:15:58,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:58,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:58,565 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-17 08:15:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376206660] [2025-03-17 08:15:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376206660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:15:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166939027] [2025-03-17 08:15:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:58,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:15:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:58,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:15:58,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:15:58,568 INFO L87 Difference]: Start difference. First operand 4223 states and 6096 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-17 08:15:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:15:58,770 INFO L93 Difference]: Finished difference Result 8488 states and 12258 transitions. [2025-03-17 08:15:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:15:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 127 [2025-03-17 08:15:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:15:58,795 INFO L225 Difference]: With dead ends: 8488 [2025-03-17 08:15:58,795 INFO L226 Difference]: Without dead ends: 4266 [2025-03-17 08:15:58,813 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-17 08:15:58,814 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 409 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2554 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:15:58,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2554 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:15:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2025-03-17 08:15:59,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 4255. [2025-03-17 08:15:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 3025 states have (on average 1.3259504132231406) internal successors, (4011), 3081 states have internal predecessors, (4011), 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-17 08:15:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 6143 transitions. [2025-03-17 08:15:59,033 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 6143 transitions. Word has length 127 [2025-03-17 08:15:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:15:59,033 INFO L471 AbstractCegarLoop]: Abstraction has 4255 states and 6143 transitions. [2025-03-17 08:15:59,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-17 08:15:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 6143 transitions. [2025-03-17 08:15:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 08:15:59,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:15:59,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-03-17 08:15:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:15:59,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:15:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:15:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -672612042, now seen corresponding path program 1 times [2025-03-17 08:15:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:15:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374796196] [2025-03-17 08:15:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:15:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:15:59,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 08:15:59,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 08:15:59,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:15:59,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:15:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-17 08:15:59,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:15:59,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374796196] [2025-03-17 08:15:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374796196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:15:59,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:15:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:15:59,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131331299] [2025-03-17 08:15:59,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:15:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:15:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:15:59,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:15:59,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:15:59,416 INFO L87 Difference]: Start difference. First operand 4255 states and 6143 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 08:16:01,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:16:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:02,276 INFO L93 Difference]: Finished difference Result 8517 states and 12296 transitions. [2025-03-17 08:16:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:16:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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 161 [2025-03-17 08:16:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:02,303 INFO L225 Difference]: With dead ends: 8517 [2025-03-17 08:16:02,303 INFO L226 Difference]: Without dead ends: 4259 [2025-03-17 08:16:02,325 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-17 08:16:02,325 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 0 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:02,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4570 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 08:16:02,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-17 08:16:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2025-03-17 08:16:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3030 states have (on average 1.325082508250825) internal successors, (4015), 3086 states have internal predecessors, (4015), 1033 states have call successors, (1033), 198 states have call predecessors, (1033), 195 states have return successors, (1097), 994 states have call predecessors, (1097), 1021 states have call successors, (1097) [2025-03-17 08:16:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6145 transitions. [2025-03-17 08:16:02,553 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6145 transitions. Word has length 161 [2025-03-17 08:16:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:02,554 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6145 transitions. [2025-03-17 08:16:02,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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-17 08:16:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6145 transitions. [2025-03-17 08:16:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 08:16:02,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:02,558 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] [2025-03-17 08:16:02,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:16:02,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:02,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash -143705, now seen corresponding path program 1 times [2025-03-17 08:16:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028872589] [2025-03-17 08:16:02,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:02,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 08:16:02,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 08:16:02,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:02,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:02,896 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-17 08:16:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028872589] [2025-03-17 08:16:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028872589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:02,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:02,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486257006] [2025-03-17 08:16:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:02,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:02,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:02,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:02,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:02,898 INFO L87 Difference]: Start difference. First operand 4259 states and 6145 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 08:16:03,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:03,064 INFO L93 Difference]: Finished difference Result 8321 states and 11993 transitions. [2025-03-17 08:16:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:03,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 152 [2025-03-17 08:16:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:03,093 INFO L225 Difference]: With dead ends: 8321 [2025-03-17 08:16:03,093 INFO L226 Difference]: Without dead ends: 4063 [2025-03-17 08:16:03,111 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-17 08:16:03,111 INFO L435 NwaCegarLoop]: 1450 mSDtfsCounter, 1430 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 1450 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:03,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 1450 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:16:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2025-03-17 08:16:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 4063. [2025-03-17 08:16:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4063 states, 2874 states have (on average 1.3190675017397355) internal successors, (3791), 2930 states have internal predecessors, (3791), 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-17 08:16:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 5837 transitions. [2025-03-17 08:16:03,280 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 5837 transitions. Word has length 152 [2025-03-17 08:16:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:03,281 INFO L471 AbstractCegarLoop]: Abstraction has 4063 states and 5837 transitions. [2025-03-17 08:16:03,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-17 08:16:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 5837 transitions. [2025-03-17 08:16:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-17 08:16:03,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:03,286 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] [2025-03-17 08:16:03,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:16:03,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:03,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1752453748, now seen corresponding path program 1 times [2025-03-17 08:16:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040727158] [2025-03-17 08:16:03,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:03,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 08:16:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 08:16:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:03,883 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-17 08:16:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:03,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040727158] [2025-03-17 08:16:03,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040727158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:03,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:03,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:16:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991109254] [2025-03-17 08:16:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:03,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:16:03,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:03,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:16:03,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:03,885 INFO L87 Difference]: Start difference. First operand 4063 states and 5837 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-17 08:16:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:04,147 INFO L93 Difference]: Finished difference Result 8137 states and 11689 transitions. [2025-03-17 08:16:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:16:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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 166 [2025-03-17 08:16:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:04,178 INFO L225 Difference]: With dead ends: 8137 [2025-03-17 08:16:04,178 INFO L226 Difference]: Without dead ends: 4075 [2025-03-17 08:16:04,195 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-17 08:16:04,196 INFO L435 NwaCegarLoop]: 1450 mSDtfsCounter, 0 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5792 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-17 08:16:04,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5792 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2025-03-17 08:16:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 4075. [2025-03-17 08:16:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4075 states, 2886 states have (on average 1.3177408177408176) internal successors, (3803), 2942 states have internal predecessors, (3803), 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-17 08:16:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4075 states to 4075 states and 5849 transitions. [2025-03-17 08:16:04,406 INFO L78 Accepts]: Start accepts. Automaton has 4075 states and 5849 transitions. Word has length 166 [2025-03-17 08:16:04,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:04,407 INFO L471 AbstractCegarLoop]: Abstraction has 4075 states and 5849 transitions. [2025-03-17 08:16:04,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-17 08:16:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4075 states and 5849 transitions. [2025-03-17 08:16:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-17 08:16:04,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:04,411 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] [2025-03-17 08:16:04,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:16:04,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:04,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:04,412 INFO L85 PathProgramCache]: Analyzing trace with hash -63290307, now seen corresponding path program 1 times [2025-03-17 08:16:04,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:04,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205082741] [2025-03-17 08:16:04,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:04,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:04,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 08:16:04,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 08:16:04,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:04,755 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-17 08:16:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205082741] [2025-03-17 08:16:04,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205082741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:04,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:04,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857173519] [2025-03-17 08:16:04,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:04,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:04,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:04,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:04,757 INFO L87 Difference]: Start difference. First operand 4075 states and 5849 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-17 08:16:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:05,008 INFO L93 Difference]: Finished difference Result 8177 states and 11741 transitions. [2025-03-17 08:16:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 174 [2025-03-17 08:16:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:05,042 INFO L225 Difference]: With dead ends: 8177 [2025-03-17 08:16:05,045 INFO L226 Difference]: Without dead ends: 4103 [2025-03-17 08:16:05,061 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-17 08:16:05,062 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 4 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2899 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:05,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2899 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:05,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2025-03-17 08:16:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4079. [2025-03-17 08:16:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 2890 states have (on average 1.3173010380622838) internal successors, (3807), 2946 states have internal predecessors, (3807), 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-17 08:16:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 5853 transitions. [2025-03-17 08:16:05,235 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 5853 transitions. Word has length 174 [2025-03-17 08:16:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:05,237 INFO L471 AbstractCegarLoop]: Abstraction has 4079 states and 5853 transitions. [2025-03-17 08:16:05,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-17 08:16:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 5853 transitions. [2025-03-17 08:16:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 08:16:05,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:05,239 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] [2025-03-17 08:16:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:16:05,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:05,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 956181136, now seen corresponding path program 1 times [2025-03-17 08:16:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077296850] [2025-03-17 08:16:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:05,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 08:16:05,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 08:16:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:05,680 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-17 08:16:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077296850] [2025-03-17 08:16:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077296850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855897250] [2025-03-17 08:16:05,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:05,684 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-17 08:16:05,686 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-17 08:16:06,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 08:16:06,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 08:16:06,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:06,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:06,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 08:16:06,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:06,744 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-17 08:16:06,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:16:06,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855897250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:06,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:16:06,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 08:16:06,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902433557] [2025-03-17 08:16:06,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:06,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:06,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:06,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:06,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:06,745 INFO L87 Difference]: Start difference. First operand 4079 states and 5853 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-17 08:16:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:07,378 INFO L93 Difference]: Finished difference Result 8173 states and 11745 transitions. [2025-03-17 08:16:07,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:07,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 187 [2025-03-17 08:16:07,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:07,404 INFO L225 Difference]: With dead ends: 8173 [2025-03-17 08:16:07,405 INFO L226 Difference]: Without dead ends: 4095 [2025-03-17 08:16:07,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 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-17 08:16:07,426 INFO L435 NwaCegarLoop]: 1450 mSDtfsCounter, 4 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2897 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-17 08:16:07,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2897 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 08:16:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-03-17 08:16:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 4083. [2025-03-17 08:16:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4083 states, 2894 states have (on average 1.3168624740843125) internal successors, (3811), 2950 states have internal predecessors, (3811), 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-17 08:16:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5857 transitions. [2025-03-17 08:16:07,622 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5857 transitions. Word has length 187 [2025-03-17 08:16:07,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 4083 states and 5857 transitions. [2025-03-17 08:16:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-17 08:16:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5857 transitions. [2025-03-17 08:16:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-17 08:16:07,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:07,627 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] [2025-03-17 08:16:07,641 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-17 08:16:07,831 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-17 08:16:07,831 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:07,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 863040679, now seen corresponding path program 1 times [2025-03-17 08:16:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175533839] [2025-03-17 08:16:07,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:07,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 08:16:08,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 08:16:08,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:08,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:08,306 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-17 08:16:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175533839] [2025-03-17 08:16:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175533839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101446694] [2025-03-17 08:16:08,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:08,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:08,308 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-17 08:16:08,310 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-17 08:16:09,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-17 08:16:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-17 08:16:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:09,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 2570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 08:16:09,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:09,401 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-17 08:16:09,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:16:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101446694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:16:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 08:16:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843044208] [2025-03-17 08:16:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:09,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:09,404 INFO L87 Difference]: Start difference. First operand 4083 states and 5857 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-17 08:16:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:09,580 INFO L93 Difference]: Finished difference Result 8173 states and 11741 transitions. [2025-03-17 08:16:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:09,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 190 [2025-03-17 08:16:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:09,636 INFO L225 Difference]: With dead ends: 8173 [2025-03-17 08:16:09,637 INFO L226 Difference]: Without dead ends: 4091 [2025-03-17 08:16:09,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 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-17 08:16:09,646 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2899 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:09,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2899 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2025-03-17 08:16:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4087. [2025-03-17 08:16:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4087 states, 2898 states have (on average 1.316425120772947) internal successors, (3815), 2954 states have internal predecessors, (3815), 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-17 08:16:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4087 states to 4087 states and 5861 transitions. [2025-03-17 08:16:09,802 INFO L78 Accepts]: Start accepts. Automaton has 4087 states and 5861 transitions. Word has length 190 [2025-03-17 08:16:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:09,803 INFO L471 AbstractCegarLoop]: Abstraction has 4087 states and 5861 transitions. [2025-03-17 08:16:09,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-17 08:16:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4087 states and 5861 transitions. [2025-03-17 08:16:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 08:16:09,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:09,806 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] [2025-03-17 08:16:09,820 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-17 08:16:10,006 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-17 08:16:10,007 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -260607868, now seen corresponding path program 1 times [2025-03-17 08:16:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:10,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162308777] [2025-03-17 08:16:10,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:10,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 08:16:10,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 08:16:10,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:10,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:10,410 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-17 08:16:10,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162308777] [2025-03-17 08:16:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162308777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138120599] [2025-03-17 08:16:10,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:10,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:10,413 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-17 08:16:10,416 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-17 08:16:11,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 08:16:11,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 08:16:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:11,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 2597 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:11,396 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-17 08:16:11,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:16:11,563 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-17 08:16:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138120599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:16:11,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:16:11,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 08:16:11,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22483358] [2025-03-17 08:16:11,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:16:11,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 08:16:11,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:11,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 08:16:11,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:16:11,565 INFO L87 Difference]: Start difference. First operand 4087 states and 5861 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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-17 08:16:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:11,852 INFO L93 Difference]: Finished difference Result 8261 states and 11857 transitions. [2025-03-17 08:16:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:11,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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 192 [2025-03-17 08:16:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:11,873 INFO L225 Difference]: With dead ends: 8261 [2025-03-17 08:16:11,873 INFO L226 Difference]: Without dead ends: 4175 [2025-03-17 08:16:11,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 381 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-17 08:16:11,886 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 12 mSDsluCounter, 5780 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7232 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:11,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7232 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2025-03-17 08:16:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4135. [2025-03-17 08:16:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4135 states, 2934 states have (on average 1.3166325835037491) internal successors, (3863), 2990 states have internal predecessors, (3863), 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-17 08:16:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 5933 transitions. [2025-03-17 08:16:12,037 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 5933 transitions. Word has length 192 [2025-03-17 08:16:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 4135 states and 5933 transitions. [2025-03-17 08:16:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 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-17 08:16:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 5933 transitions. [2025-03-17 08:16:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 08:16:12,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:12,043 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] [2025-03-17 08:16:12,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 08:16:12,243 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-17 08:16:12,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:12,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:12,244 INFO L85 PathProgramCache]: Analyzing trace with hash -980316873, now seen corresponding path program 2 times [2025-03-17 08:16:12,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:12,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847217747] [2025-03-17 08:16:12,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:16:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:12,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 231 statements into 2 equivalence classes. [2025-03-17 08:16:12,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 231 statements. [2025-03-17 08:16:12,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 08:16:12,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:12,759 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-17 08:16:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:12,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847217747] [2025-03-17 08:16:12,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847217747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:12,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779241724] [2025-03-17 08:16:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:12,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:12,762 INFO L87 Difference]: Start difference. First operand 4135 states and 5933 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-17 08:16:16,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:16:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:16,334 INFO L93 Difference]: Finished difference Result 8281 states and 11900 transitions. [2025-03-17 08:16:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:16,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 231 [2025-03-17 08:16:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:16,356 INFO L225 Difference]: With dead ends: 8281 [2025-03-17 08:16:16,356 INFO L226 Difference]: Without dead ends: 4147 [2025-03-17 08:16:16,368 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-17 08:16:16,369 INFO L435 NwaCegarLoop]: 2817 mSDtfsCounter, 1427 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:16,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 4257 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-17 08:16:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4147 states. [2025-03-17 08:16:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4147 to 4133. [2025-03-17 08:16:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 2932 states have (on average 1.3154843110504775) internal successors, (3857), 2989 states have internal predecessors, (3857), 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-17 08:16:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 5903 transitions. [2025-03-17 08:16:16,547 INFO L78 Accepts]: Start accepts. Automaton has 4133 states and 5903 transitions. Word has length 231 [2025-03-17 08:16:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:16,547 INFO L471 AbstractCegarLoop]: Abstraction has 4133 states and 5903 transitions. [2025-03-17 08:16:16,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-17 08:16:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 4133 states and 5903 transitions. [2025-03-17 08:16:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-17 08:16:16,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:16,552 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] [2025-03-17 08:16:16,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 08:16:16,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:16,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:16,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1509212089, now seen corresponding path program 1 times [2025-03-17 08:16:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10950056] [2025-03-17 08:16:16,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 08:16:16,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 08:16:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:16,989 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-17 08:16:16,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10950056] [2025-03-17 08:16:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10950056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:16,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346856700] [2025-03-17 08:16:16,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:16,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:16,991 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-17 08:16:16,993 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-17 08:16:17,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-17 08:16:17,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-17 08:16:17,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:17,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:17,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 2782 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:17,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:18,008 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-17 08:16:18,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:16:18,203 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-17 08:16:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346856700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:16:18,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:16:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 08:16:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019948304] [2025-03-17 08:16:18,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:16:18,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 08:16:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:18,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 08:16:18,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:16:18,205 INFO L87 Difference]: Start difference. First operand 4133 states and 5903 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-17 08:16:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:18,383 INFO L93 Difference]: Finished difference Result 8289 states and 11857 transitions. [2025-03-17 08:16:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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 231 [2025-03-17 08:16:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:18,402 INFO L225 Difference]: With dead ends: 8289 [2025-03-17 08:16:18,402 INFO L226 Difference]: Without dead ends: 4157 [2025-03-17 08:16:18,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 459 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-17 08:16:18,414 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 2 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4347 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:18,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4347 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2025-03-17 08:16:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 4157. [2025-03-17 08:16:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 2956 states have (on average 1.3129228687415426) internal successors, (3881), 3013 states have internal predecessors, (3881), 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-17 08:16:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5927 transitions. [2025-03-17 08:16:18,624 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5927 transitions. Word has length 231 [2025-03-17 08:16:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:18,627 INFO L471 AbstractCegarLoop]: Abstraction has 4157 states and 5927 transitions. [2025-03-17 08:16:18,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 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-17 08:16:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5927 transitions. [2025-03-17 08:16:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-17 08:16:18,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:18,632 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] [2025-03-17 08:16:18,662 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-17 08:16:18,838 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-17 08:16:18,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:18,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:18,839 INFO L85 PathProgramCache]: Analyzing trace with hash 2128849914, now seen corresponding path program 1 times [2025-03-17 08:16:18,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:18,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801695648] [2025-03-17 08:16:18,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:18,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-17 08:16:19,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-17 08:16:19,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:19,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:19,137 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-17 08:16:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:19,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801695648] [2025-03-17 08:16:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801695648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98056085] [2025-03-17 08:16:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:19,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:19,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:19,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:19,138 INFO L87 Difference]: Start difference. First operand 4157 states and 5927 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-17 08:16:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:19,329 INFO L93 Difference]: Finished difference Result 8329 states and 11885 transitions. [2025-03-17 08:16:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 245 [2025-03-17 08:16:19,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:19,349 INFO L225 Difference]: With dead ends: 8329 [2025-03-17 08:16:19,349 INFO L226 Difference]: Without dead ends: 4173 [2025-03-17 08:16:19,359 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-17 08:16:19,360 INFO L435 NwaCegarLoop]: 1450 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2897 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:19,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2897 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2025-03-17 08:16:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4161. [2025-03-17 08:16:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4161 states, 2960 states have (on average 1.3125) internal successors, (3885), 3017 states have internal predecessors, (3885), 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-17 08:16:19,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4161 states to 4161 states and 5931 transitions. [2025-03-17 08:16:19,497 INFO L78 Accepts]: Start accepts. Automaton has 4161 states and 5931 transitions. Word has length 245 [2025-03-17 08:16:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:19,497 INFO L471 AbstractCegarLoop]: Abstraction has 4161 states and 5931 transitions. [2025-03-17 08:16:19,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-17 08:16:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 4161 states and 5931 transitions. [2025-03-17 08:16:19,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-17 08:16:19,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:19,502 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] [2025-03-17 08:16:19,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 08:16:19,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:19,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1535324784, now seen corresponding path program 2 times [2025-03-17 08:16:19,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:19,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506181761] [2025-03-17 08:16:19,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:16:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:19,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-03-17 08:16:19,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 237 statements. [2025-03-17 08:16:19,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 08:16:19,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:19,803 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-17 08:16:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506181761] [2025-03-17 08:16:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506181761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:16:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026491987] [2025-03-17 08:16:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:19,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:16:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:19,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:16:19,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:19,806 INFO L87 Difference]: Start difference. First operand 4161 states and 5931 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-17 08:16:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:19,994 INFO L93 Difference]: Finished difference Result 4185 states and 5952 transitions. [2025-03-17 08:16:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:16:19,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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 237 [2025-03-17 08:16:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:20,015 INFO L225 Difference]: With dead ends: 4185 [2025-03-17 08:16:20,015 INFO L226 Difference]: Without dead ends: 4079 [2025-03-17 08:16:20,018 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-17 08:16:20,019 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 1 mSDsluCounter, 4343 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5798 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-17 08:16:20,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5798 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2025-03-17 08:16:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 4079. [2025-03-17 08:16:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4079 states, 2906 states have (on average 1.3107364074328975) internal successors, (3809), 2957 states have internal predecessors, (3809), 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-17 08:16:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4079 states to 4079 states and 5803 transitions. [2025-03-17 08:16:20,394 INFO L78 Accepts]: Start accepts. Automaton has 4079 states and 5803 transitions. Word has length 237 [2025-03-17 08:16:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:20,400 INFO L471 AbstractCegarLoop]: Abstraction has 4079 states and 5803 transitions. [2025-03-17 08:16:20,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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-17 08:16:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4079 states and 5803 transitions. [2025-03-17 08:16:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-17 08:16:20,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:20,406 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] [2025-03-17 08:16:20,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 08:16:20,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 257805983, now seen corresponding path program 1 times [2025-03-17 08:16:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034943591] [2025-03-17 08:16:20,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:20,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 08:16:20,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 08:16:20,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:20,800 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-17 08:16:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034943591] [2025-03-17 08:16:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034943591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755464513] [2025-03-17 08:16:20,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:20,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:20,802 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-17 08:16:20,804 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-17 08:16:21,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 08:16:21,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 08:16:21,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:21,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:21,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 2684 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 08:16:21,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:21,773 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-17 08:16:21,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:16:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755464513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:21,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:16:21,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 08:16:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992946330] [2025-03-17 08:16:21,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:21,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:21,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:21,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:21,775 INFO L87 Difference]: Start difference. First operand 4079 states and 5803 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 08:16:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:21,952 INFO L93 Difference]: Finished difference Result 8173 states and 11645 transitions. [2025-03-17 08:16:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 252 [2025-03-17 08:16:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:21,975 INFO L225 Difference]: With dead ends: 8173 [2025-03-17 08:16:21,976 INFO L226 Difference]: Without dead ends: 4095 [2025-03-17 08:16:21,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 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-17 08:16:21,987 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 2 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2893 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-17 08:16:21,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2893 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:16:21,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-03-17 08:16:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 4083. [2025-03-17 08:16:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4083 states, 2910 states have (on average 1.3103092783505155) internal successors, (3813), 2961 states have internal predecessors, (3813), 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-17 08:16:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 5807 transitions. [2025-03-17 08:16:22,132 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 5807 transitions. Word has length 252 [2025-03-17 08:16:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 4083 states and 5807 transitions. [2025-03-17 08:16:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 08:16:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 5807 transitions. [2025-03-17 08:16:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 08:16:22,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:22,138 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] [2025-03-17 08:16:22,153 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-17 08:16:22,338 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-17 08:16:22,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:22,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1500267035, now seen corresponding path program 1 times [2025-03-17 08:16:22,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39872600] [2025-03-17 08:16:22,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:22,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:22,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 08:16:22,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 08:16:22,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:22,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:22,717 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-17 08:16:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:22,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39872600] [2025-03-17 08:16:22,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39872600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264439145] [2025-03-17 08:16:22,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:22,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:22,722 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-17 08:16:22,723 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-17 08:16:23,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-17 08:16:23,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 08:16:23,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:23,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 2703 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:23,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:23,762 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-17 08:16:23,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:16:23,958 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-17 08:16:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264439145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:16:23,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:16:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 08:16:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612578881] [2025-03-17 08:16:23,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:16:23,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 08:16:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:23,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 08:16:23,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:16:23,960 INFO L87 Difference]: Start difference. First operand 4083 states and 5807 transitions. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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-17 08:16:24,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:24,158 INFO L93 Difference]: Finished difference Result 8213 states and 11693 transitions. [2025-03-17 08:16:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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 259 [2025-03-17 08:16:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:24,178 INFO L225 Difference]: With dead ends: 8213 [2025-03-17 08:16:24,178 INFO L226 Difference]: Without dead ends: 4131 [2025-03-17 08:16:24,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 515 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-17 08:16:24,189 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 4 mSDsluCounter, 5776 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7224 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-17 08:16:24,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7224 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2025-03-17 08:16:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 4131. [2025-03-17 08:16:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4131 states, 2946 states have (on average 1.3065173116089612) internal successors, (3849), 2997 states have internal predecessors, (3849), 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-17 08:16:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4131 states to 4131 states and 5867 transitions. [2025-03-17 08:16:24,364 INFO L78 Accepts]: Start accepts. Automaton has 4131 states and 5867 transitions. Word has length 259 [2025-03-17 08:16:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:24,364 INFO L471 AbstractCegarLoop]: Abstraction has 4131 states and 5867 transitions. [2025-03-17 08:16:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 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-17 08:16:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4131 states and 5867 transitions. [2025-03-17 08:16:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-17 08:16:24,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:24,370 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] [2025-03-17 08:16:24,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 08:16:24,571 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-17 08:16:24,571 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 603991968, now seen corresponding path program 2 times [2025-03-17 08:16:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:24,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189519741] [2025-03-17 08:16:24,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:16:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:24,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 280 statements into 2 equivalence classes. [2025-03-17 08:16:24,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 280 statements. [2025-03-17 08:16:24,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 08:16:24,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:24,828 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-17 08:16:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189519741] [2025-03-17 08:16:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189519741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688249834] [2025-03-17 08:16:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:24,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:24,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:24,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:24,831 INFO L87 Difference]: Start difference. First operand 4131 states and 5867 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 08:16:27,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:16:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:27,637 INFO L93 Difference]: Finished difference Result 8266 states and 11737 transitions. [2025-03-17 08:16:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:27,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 280 [2025-03-17 08:16:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:27,666 INFO L225 Difference]: With dead ends: 8266 [2025-03-17 08:16:27,666 INFO L226 Difference]: Without dead ends: 4136 [2025-03-17 08:16:27,680 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-17 08:16:27,680 INFO L435 NwaCegarLoop]: 2796 mSDtfsCounter, 1430 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4236 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:27,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 4236 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-17 08:16:27,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2025-03-17 08:16:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 4120. [2025-03-17 08:16:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4120 states, 2937 states have (on average 1.3057541709227103) internal successors, (3835), 2990 states have internal predecessors, (3835), 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-17 08:16:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 5827 transitions. [2025-03-17 08:16:27,949 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 5827 transitions. Word has length 280 [2025-03-17 08:16:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:27,950 INFO L471 AbstractCegarLoop]: Abstraction has 4120 states and 5827 transitions. [2025-03-17 08:16:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-17 08:16:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 5827 transitions. [2025-03-17 08:16:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-17 08:16:27,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:27,955 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] [2025-03-17 08:16:27,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 08:16:27,955 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:27,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash 310588961, now seen corresponding path program 1 times [2025-03-17 08:16:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:27,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095714033] [2025-03-17 08:16:27,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:28,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-17 08:16:28,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-17 08:16:28,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:28,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:28,280 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-17 08:16:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095714033] [2025-03-17 08:16:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095714033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173432279] [2025-03-17 08:16:28,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:28,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:28,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:28,283 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-17 08:16:28,284 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-17 08:16:29,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-03-17 08:16:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-03-17 08:16:29,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:29,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:29,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 2759 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:29,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:29,431 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-17 08:16:29,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:16:29,619 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-17 08:16:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173432279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:16:29,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:16:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 08:16:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765009207] [2025-03-17 08:16:29,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:16:29,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 08:16:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:29,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 08:16:29,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:16:29,621 INFO L87 Difference]: Start difference. First operand 4120 states and 5827 transitions. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-17 08:16:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:29,808 INFO L93 Difference]: Finished difference Result 8287 states and 11741 transitions. [2025-03-17 08:16:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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 280 [2025-03-17 08:16:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:29,836 INFO L225 Difference]: With dead ends: 8287 [2025-03-17 08:16:29,837 INFO L226 Difference]: Without dead ends: 4168 [2025-03-17 08:16:29,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 557 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-17 08:16:29,852 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 4 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4336 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:29,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4336 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2025-03-17 08:16:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4168. [2025-03-17 08:16:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 2973 states have (on average 1.3020517995290952) internal successors, (3871), 3026 states have internal predecessors, (3871), 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-17 08:16:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5887 transitions. [2025-03-17 08:16:30,008 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5887 transitions. Word has length 280 [2025-03-17 08:16:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:30,010 INFO L471 AbstractCegarLoop]: Abstraction has 4168 states and 5887 transitions. [2025-03-17 08:16:30,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 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-17 08:16:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5887 transitions. [2025-03-17 08:16:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-17 08:16:30,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:30,016 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] [2025-03-17 08:16:30,034 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-17 08:16:30,217 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-17 08:16:30,217 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:30,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:30,218 INFO L85 PathProgramCache]: Analyzing trace with hash 298177979, now seen corresponding path program 2 times [2025-03-17 08:16:30,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:30,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619077565] [2025-03-17 08:16:30,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 08:16:30,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:30,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 301 statements into 2 equivalence classes. [2025-03-17 08:16:30,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 47 of 301 statements. [2025-03-17 08:16:30,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 08:16:30,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:30,555 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-17 08:16:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619077565] [2025-03-17 08:16:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619077565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:30,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:30,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:16:30,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593941918] [2025-03-17 08:16:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:16:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:30,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:16:30,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:16:30,557 INFO L87 Difference]: Start difference. First operand 4168 states and 5887 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-17 08:16:30,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:30,759 INFO L93 Difference]: Finished difference Result 4179 states and 5895 transitions. [2025-03-17 08:16:30,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:30,759 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 301 [2025-03-17 08:16:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:30,785 INFO L225 Difference]: With dead ends: 4179 [2025-03-17 08:16:30,785 INFO L226 Difference]: Without dead ends: 4156 [2025-03-17 08:16:30,788 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-17 08:16:30,790 INFO L435 NwaCegarLoop]: 1454 mSDtfsCounter, 0 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7256 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-17 08:16:30,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7256 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2025-03-17 08:16:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4156. [2025-03-17 08:16:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 2964 states have (on average 1.300944669365722) internal successors, (3856), 3016 states have internal predecessors, (3856), 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-17 08:16:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5867 transitions. [2025-03-17 08:16:30,939 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5867 transitions. Word has length 301 [2025-03-17 08:16:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:30,940 INFO L471 AbstractCegarLoop]: Abstraction has 4156 states and 5867 transitions. [2025-03-17 08:16:30,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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-17 08:16:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5867 transitions. [2025-03-17 08:16:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-17 08:16:30,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:30,946 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] [2025-03-17 08:16:30,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 08:16:30,947 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:30,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1119238955, now seen corresponding path program 1 times [2025-03-17 08:16:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:30,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557616542] [2025-03-17 08:16:30,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:30,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:31,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-17 08:16:31,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-17 08:16:31,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:31,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:31,440 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-17 08:16:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557616542] [2025-03-17 08:16:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557616542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694841307] [2025-03-17 08:16:31,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:31,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:31,443 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-17 08:16:31,445 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-17 08:16:32,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-17 08:16:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-17 08:16:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:32,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:32,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:32,707 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-17 08:16:32,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:16:32,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694841307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:32,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:16:32,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-17 08:16:32,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188240151] [2025-03-17 08:16:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:32,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:32,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:32,709 INFO L87 Difference]: Start difference. First operand 4156 states and 5867 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 08:16:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:32,949 INFO L93 Difference]: Finished difference Result 8319 states and 11745 transitions. [2025-03-17 08:16:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:32,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 300 [2025-03-17 08:16:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:32,981 INFO L225 Difference]: With dead ends: 8319 [2025-03-17 08:16:32,981 INFO L226 Difference]: Without dead ends: 4164 [2025-03-17 08:16:32,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 300 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-17 08:16:32,997 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 0 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:32,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2890 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:16:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4164 states. [2025-03-17 08:16:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4164 to 4164. [2025-03-17 08:16:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 2972 states have (on average 1.3001345895020189) internal successors, (3864), 3024 states have internal predecessors, (3864), 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-17 08:16:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 5875 transitions. [2025-03-17 08:16:33,151 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 5875 transitions. Word has length 300 [2025-03-17 08:16:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:33,153 INFO L471 AbstractCegarLoop]: Abstraction has 4164 states and 5875 transitions. [2025-03-17 08:16:33,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-17 08:16:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 5875 transitions. [2025-03-17 08:16:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-17 08:16:33,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:33,160 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] [2025-03-17 08:16:33,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 08:16:33,360 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-17 08:16:33,361 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:33,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -681229452, now seen corresponding path program 1 times [2025-03-17 08:16:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375328579] [2025-03-17 08:16:33,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:33,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-17 08:16:33,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-17 08:16:33,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:33,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:33,801 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-17 08:16:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375328579] [2025-03-17 08:16:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375328579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:16:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871634895] [2025-03-17 08:16:33,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:33,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:16:33,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:16:33,804 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-17 08:16:33,806 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-17 08:16:34,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-17 08:16:34,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-17 08:16:34,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:34,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:16:34,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:16:34,981 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-17 08:16:34,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 08:16:35,179 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-17 08:16:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871634895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 08:16:35,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 08:16:35,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 08:16:35,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690828034] [2025-03-17 08:16:35,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 08:16:35,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 08:16:35,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:35,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 08:16:35,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:16:35,180 INFO L87 Difference]: Start difference. First operand 4164 states and 5875 transitions. Second operand has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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-17 08:16:35,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:35,926 INFO L93 Difference]: Finished difference Result 8459 states and 11917 transitions. [2025-03-17 08:16:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:35,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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 300 [2025-03-17 08:16:35,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:35,945 INFO L225 Difference]: With dead ends: 8459 [2025-03-17 08:16:35,945 INFO L226 Difference]: Without dead ends: 4296 [2025-03-17 08:16:35,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 597 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-17 08:16:35,954 INFO L435 NwaCegarLoop]: 1448 mSDtfsCounter, 8 mSDsluCounter, 4337 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5785 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:35,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5785 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 08:16:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2025-03-17 08:16:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4296. [2025-03-17 08:16:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 3104 states have (on average 1.291237113402062) internal successors, (4008), 3156 states have internal predecessors, (4008), 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-17 08:16:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6019 transitions. [2025-03-17 08:16:36,138 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6019 transitions. Word has length 300 [2025-03-17 08:16:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 4296 states and 6019 transitions. [2025-03-17 08:16:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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-17 08:16:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6019 transitions. [2025-03-17 08:16:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-17 08:16:36,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:36,144 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] [2025-03-17 08:16:36,159 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-17 08:16:36,344 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-17 08:16:36,345 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:36,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1328570834, now seen corresponding path program 1 times [2025-03-17 08:16:36,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:36,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374410643] [2025-03-17 08:16:36,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:36,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:36,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-17 08:16:36,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-17 08:16:36,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:36,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:36,586 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-17 08:16:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:36,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374410643] [2025-03-17 08:16:36,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374410643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:36,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:36,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:16:36,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060083023] [2025-03-17 08:16:36,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:36,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:16:36,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:36,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:16:36,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:16:36,587 INFO L87 Difference]: Start difference. First operand 4296 states and 6019 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-17 08:16:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:36,718 INFO L93 Difference]: Finished difference Result 8591 states and 12037 transitions. [2025-03-17 08:16:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:16:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 323 [2025-03-17 08:16:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:36,737 INFO L225 Difference]: With dead ends: 8591 [2025-03-17 08:16:36,737 INFO L226 Difference]: Without dead ends: 4296 [2025-03-17 08:16:36,747 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-17 08:16:36,748 INFO L435 NwaCegarLoop]: 1449 mSDtfsCounter, 0 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2885 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-17 08:16:36,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:16:36,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2025-03-17 08:16:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4296. [2025-03-17 08:16:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4296 states, 3104 states have (on average 1.2899484536082475) internal successors, (4004), 3152 states have internal predecessors, (4004), 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-17 08:16:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4296 states to 4296 states and 6015 transitions. [2025-03-17 08:16:36,871 INFO L78 Accepts]: Start accepts. Automaton has 4296 states and 6015 transitions. Word has length 323 [2025-03-17 08:16:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 4296 states and 6015 transitions. [2025-03-17 08:16:36,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-17 08:16:36,873 INFO L276 IsEmpty]: Start isEmpty. Operand 4296 states and 6015 transitions. [2025-03-17 08:16:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-17 08:16:36,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:36,878 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] [2025-03-17 08:16:36,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 08:16:36,878 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:36,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1928350147, now seen corresponding path program 1 times [2025-03-17 08:16:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549832945] [2025-03-17 08:16:36,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:37,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-17 08:16:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-17 08:16:37,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:37,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:37,294 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-17 08:16:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549832945] [2025-03-17 08:16:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549832945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 08:16:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465348906] [2025-03-17 08:16:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 08:16:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:37,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 08:16:37,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:16:37,296 INFO L87 Difference]: Start difference. First operand 4296 states and 6015 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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-17 08:16:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:37,459 INFO L93 Difference]: Finished difference Result 6351 states and 8898 transitions. [2025-03-17 08:16:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 08:16:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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 338 [2025-03-17 08:16:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:37,484 INFO L225 Difference]: With dead ends: 6351 [2025-03-17 08:16:37,484 INFO L226 Difference]: Without dead ends: 4284 [2025-03-17 08:16:37,489 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-17 08:16:37,489 INFO L435 NwaCegarLoop]: 1447 mSDtfsCounter, 0 mSDsluCounter, 5782 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7229 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-17 08:16:37,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7229 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4284 states. [2025-03-17 08:16:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4284 to 4284. [2025-03-17 08:16:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4284 states, 3094 states have (on average 1.2902391725921138) internal successors, (3992), 3144 states have internal predecessors, (3992), 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-17 08:16:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4284 states to 4284 states and 5999 transitions. [2025-03-17 08:16:37,600 INFO L78 Accepts]: Start accepts. Automaton has 4284 states and 5999 transitions. Word has length 338 [2025-03-17 08:16:37,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:37,601 INFO L471 AbstractCegarLoop]: Abstraction has 4284 states and 5999 transitions. [2025-03-17 08:16:37,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 5 states have internal predecessors, (176), 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-17 08:16:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4284 states and 5999 transitions. [2025-03-17 08:16:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-17 08:16:37,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:37,605 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] [2025-03-17 08:16:37,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 08:16:37,606 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:37,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1834430006, now seen corresponding path program 1 times [2025-03-17 08:16:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:37,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823230232] [2025-03-17 08:16:37,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:37,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-17 08:16:37,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-17 08:16:37,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:37,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:38,014 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-17 08:16:38,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:38,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823230232] [2025-03-17 08:16:38,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823230232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:38,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:38,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:16:38,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345683626] [2025-03-17 08:16:38,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:38,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:16:38,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:38,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:16:38,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:38,016 INFO L87 Difference]: Start difference. First operand 4284 states and 5999 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 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-17 08:16:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:38,211 INFO L93 Difference]: Finished difference Result 4327 states and 6039 transitions. [2025-03-17 08:16:38,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:16:38,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 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 361 [2025-03-17 08:16:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:38,228 INFO L225 Difference]: With dead ends: 4327 [2025-03-17 08:16:38,228 INFO L226 Difference]: Without dead ends: 2240 [2025-03-17 08:16:38,232 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-17 08:16:38,233 INFO L435 NwaCegarLoop]: 1440 mSDtfsCounter, 0 mSDsluCounter, 4305 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5745 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-17 08:16:38,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5745 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:16:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2025-03-17 08:16:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2240. [2025-03-17 08:16:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2240 states, 1614 states have (on average 1.2856257744733581) internal successors, (2075), 1638 states have internal predecessors, (2075), 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-17 08:16:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 3110 transitions. [2025-03-17 08:16:38,344 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 3110 transitions. Word has length 361 [2025-03-17 08:16:38,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:38,345 INFO L471 AbstractCegarLoop]: Abstraction has 2240 states and 3110 transitions. [2025-03-17 08:16:38,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 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-17 08:16:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 3110 transitions. [2025-03-17 08:16:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2025-03-17 08:16:38,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:38,351 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] [2025-03-17 08:16:38,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 08:16:38,351 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:38,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:38,351 INFO L85 PathProgramCache]: Analyzing trace with hash 485734997, now seen corresponding path program 1 times [2025-03-17 08:16:38,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:38,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531815025] [2025-03-17 08:16:38,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:38,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:38,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 374 statements into 1 equivalence classes. [2025-03-17 08:16:38,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 374 of 374 statements. [2025-03-17 08:16:38,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:38,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:38,997 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-17 08:16:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:38,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531815025] [2025-03-17 08:16:38,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531815025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:38,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:16:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385109527] [2025-03-17 08:16:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:16:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:38,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:16:38,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:38,999 INFO L87 Difference]: Start difference. First operand 2240 states and 3110 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 4 states have internal predecessors, (189), 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-17 08:16:43,092 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-17 08:16:47,098 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-17 08:16:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:47,173 INFO L93 Difference]: Finished difference Result 4487 states and 6245 transitions. [2025-03-17 08:16:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:16:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 4 states have internal predecessors, (189), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) Word has length 374 [2025-03-17 08:16:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:47,189 INFO L225 Difference]: With dead ends: 4487 [2025-03-17 08:16:47,189 INFO L226 Difference]: Without dead ends: 2248 [2025-03-17 08:16:47,193 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-17 08:16:47,193 INFO L435 NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5754 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:47,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5754 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-17 08:16:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2025-03-17 08:16:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2248. [2025-03-17 08:16:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1620 states have (on average 1.2845679012345679) internal successors, (2081), 1644 states have internal predecessors, (2081), 521 states have call successors, (521), 107 states have call predecessors, (521), 106 states have return successors, (532), 504 states have call predecessors, (532), 510 states have call successors, (532) [2025-03-17 08:16:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3134 transitions. [2025-03-17 08:16:47,257 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3134 transitions. Word has length 374 [2025-03-17 08:16:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:47,258 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3134 transitions. [2025-03-17 08:16:47,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 4 states have internal predecessors, (189), 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-17 08:16:47,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3134 transitions. [2025-03-17 08:16:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-17 08:16:47,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:47,262 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:16:47,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 08:16:47,262 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:47,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -915754019, now seen corresponding path program 1 times [2025-03-17 08:16:47,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:47,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239430768] [2025-03-17 08:16:47,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:47,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:47,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-17 08:16:47,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-17 08:16:47,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:47,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-03-17 08:16:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239430768] [2025-03-17 08:16:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239430768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 08:16:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608174773] [2025-03-17 08:16:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:47,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 08:16:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:47,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 08:16:47,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:16:47,895 INFO L87 Difference]: Start difference. First operand 2248 states and 3134 transitions. Second operand has 8 states, 8 states have (on average 25.125) internal successors, (201), 7 states have internal predecessors, (201), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 08:16:52,023 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-17 08:16:56,036 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-17 08:16:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:56,114 INFO L93 Difference]: Finished difference Result 4503 states and 6293 transitions. [2025-03-17 08:16:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 08:16:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 7 states have internal predecessors, (201), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) Word has length 394 [2025-03-17 08:16:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:56,129 INFO L225 Difference]: With dead ends: 4503 [2025-03-17 08:16:56,129 INFO L226 Difference]: Without dead ends: 2256 [2025-03-17 08:16:56,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 08:16:56,134 INFO L435 NwaCegarLoop]: 1437 mSDtfsCounter, 4 mSDsluCounter, 8585 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10022 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:56,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10022 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-17 08:16:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-17 08:16:56,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2248. [2025-03-17 08:16:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2248 states, 1620 states have (on average 1.2845679012345679) internal successors, (2081), 1644 states have internal predecessors, (2081), 521 states have call successors, (521), 107 states have call predecessors, (521), 106 states have return successors, (532), 504 states have call predecessors, (532), 510 states have call successors, (532) [2025-03-17 08:16:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 3134 transitions. [2025-03-17 08:16:56,202 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 3134 transitions. Word has length 394 [2025-03-17 08:16:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:56,202 INFO L471 AbstractCegarLoop]: Abstraction has 2248 states and 3134 transitions. [2025-03-17 08:16:56,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.125) internal successors, (201), 7 states have internal predecessors, (201), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-17 08:16:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 3134 transitions. [2025-03-17 08:16:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-17 08:16:56,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:56,206 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, 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] [2025-03-17 08:16:56,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 08:16:56,206 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 768787518, now seen corresponding path program 1 times [2025-03-17 08:16:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599409787] [2025-03-17 08:16:56,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:56,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-17 08:16:56,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-17 08:16:56,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:56,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:16:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-03-17 08:16:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:16:56,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599409787] [2025-03-17 08:16:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599409787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:16:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:16:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 08:16:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346189512] [2025-03-17 08:16:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:16:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 08:16:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:16:56,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 08:16:56,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 08:16:56,609 INFO L87 Difference]: Start difference. First operand 2248 states and 3134 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 08:16:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:16:56,718 INFO L93 Difference]: Finished difference Result 4503 states and 6293 transitions. [2025-03-17 08:16:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 08:16:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) Word has length 402 [2025-03-17 08:16:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:16:56,734 INFO L225 Difference]: With dead ends: 4503 [2025-03-17 08:16:56,735 INFO L226 Difference]: Without dead ends: 2256 [2025-03-17 08:16:56,739 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-17 08:16:56,739 INFO L435 NwaCegarLoop]: 1441 mSDtfsCounter, 0 mSDsluCounter, 4314 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5755 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 08:16:56,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5755 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 08:16:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2025-03-17 08:16:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2025-03-17 08:16:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 1626 states have (on average 1.2835178351783518) internal successors, (2087), 1650 states have internal predecessors, (2087), 521 states have call successors, (521), 107 states have call predecessors, (521), 108 states have return successors, (550), 506 states have call predecessors, (550), 510 states have call successors, (550) [2025-03-17 08:16:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3158 transitions. [2025-03-17 08:16:56,849 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3158 transitions. Word has length 402 [2025-03-17 08:16:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:16:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3158 transitions. [2025-03-17 08:16:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (37), 3 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-17 08:16:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3158 transitions. [2025-03-17 08:16:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-03-17 08:16:56,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:16:56,854 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:16:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 08:16:56,854 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:16:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:16:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2060857589, now seen corresponding path program 1 times [2025-03-17 08:16:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:16:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710948031] [2025-03-17 08:16:56,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:16:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:16:57,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-03-17 08:16:57,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-03-17 08:16:57,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:16:57,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat