./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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-?-e2fb8be-m [2025-03-08 19:08:04,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:08:04,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:08:04,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:08:04,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:08:04,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:08:04,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:08:04,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:08:04,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:08:04,656 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:08:04,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:08:04,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:08:04,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:08:04,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:08:04,658 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:08:04,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:08:04,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:08:04,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:08:04,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:08:04,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:08:04,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:08:04,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:08:04,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:08:04,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:08:04,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:08:04,661 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-08 19:08:04,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:08:04,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:08:04,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:08:04,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:08:04,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:08:04,879 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-08 19:08:06,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a2d63e5/ca098aca04a54b1080e4bf35d1eb5397/FLAG4200096f0 [2025-03-08 19:08:06,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:08:06,527 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-08 19:08:06,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a2d63e5/ca098aca04a54b1080e4bf35d1eb5397/FLAG4200096f0 [2025-03-08 19:08:07,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25a2d63e5/ca098aca04a54b1080e4bf35d1eb5397 [2025-03-08 19:08:07,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:08:07,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:08:07,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:08:07,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:08:07,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:08:07,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:08:07" (1/1) ... [2025-03-08 19:08:07,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714a3b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:07, skipping insertion in model container [2025-03-08 19:08:07,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:08:07" (1/1) ... [2025-03-08 19:08:07,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:08:08,670 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-08 19:08:08,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:08:08,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:08:08,826 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-08 19:08:08,827 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-08 19:08:08,828 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [6119] [2025-03-08 19:08:08,830 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-08 19:08:08,830 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-08 19:08:08,986 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-08 19:08:08,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:08:09,036 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:08:09,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09 WrapperNode [2025-03-08 19:08:09,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:08:09,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:08:09,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:08:09,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:08:09,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,199 INFO L138 Inliner]: procedures = 216, calls = 1507, calls flagged for inlining = 108, calls inlined = 97, statements flattened = 3386 [2025-03-08 19:08:09,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:08:09,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:08:09,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:08:09,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:08:09,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,501 INFO L175 MemorySlicer]: Split 587 memory accesses to 18 slices as follows [2, 1, 3, 3, 5, 5, 8, 2, 8, 4, 1, 2, 110, 415, 8, 8, 1, 1]. 71 percent of accesses are in the largest equivalence class. The 129 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0, 8, 0, 1, 0, 110, 0, 8, 0, 0, 0]. The 239 writes are split as follows [0, 0, 2, 1, 0, 0, 1, 0, 0, 2, 0, 0, 0, 231, 0, 2, 0, 0]. [2025-03-08 19:08:09,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,582 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:08:09,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:08:09,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:08:09,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:08:09,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (1/1) ... [2025-03-08 19:08:09,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:08:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:09,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:08:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:08:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-08 19:08:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-08 19:08:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2025-03-08 19:08:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2025-03-08 19:08:09,720 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-08 19:08:09,720 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-08 19:08:09,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#15 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#16 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#17 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:08:09,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_iso_mutex_of_ttusb_dec [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2025-03-08 19:08:09,723 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-08 19:08:09,723 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_ttusb_dec [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 19:08:09,724 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:08:09,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-08 19:08:09,725 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-08 19:08:09,725 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-08 19:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2025-03-08 19:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2025-03-08 19:08:09,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#15 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#16 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#17 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2025-03-08 19:08:09,728 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 19:08:09,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-08 19:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-08 19:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-08 19:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-08 19:08:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2025-03-08 19:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-08 19:08:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:08:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:08:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#16 [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#17 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#8 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#9 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#10 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#11 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#12 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#13 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#14 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#15 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#16 [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#17 [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-08 19:08:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2025-03-08 19:08:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2025-03-08 19:08:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2025-03-08 19:08:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:08:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2025-03-08 19:08:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2025-03-08 19:08:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:08:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-08 19:08:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-08 19:08:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_iso_mutex_of_ttusb_dec [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:08:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-08 19:08:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2025-03-08 19:08:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-08 19:08:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:08:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 19:08:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:08:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:08:10,299 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:08:10,302 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:08:10,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6195: havoc arch_irqs_disabled_flags_#t~bitwise25#1; [2025-03-08 19:08:10,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9401: havoc #t~nondet880; [2025-03-08 19:08:10,780 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9397: havoc #t~nondet879; [2025-03-08 19:08:10,783 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9304: havoc #t~nondet866; [2025-03-08 19:08:10,792 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6257: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-08 19:08:10,835 INFO L1307 $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-08 19:08:11,202 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9340: havoc #t~nondet869; [2025-03-08 19:08:11,204 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9351: havoc #t~nondet871; [2025-03-08 19:08:11,218 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6267: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-03-08 19:08:11,239 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6126: havoc #t~bitwise1; [2025-03-08 19:08:11,241 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9244: havoc #t~nondet856; [2025-03-08 19:08:11,246 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9264: havoc dev_set_drvdata_#t~nondet859#1; [2025-03-08 19:08:11,282 INFO L1307 $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-08 19:08:11,285 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9380: havoc #t~ret877.base, #t~ret877.offset; [2025-03-08 19:08:11,295 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6306: havoc #t~mem65.base, #t~mem65.offset; [2025-03-08 19:08:11,303 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9384: havoc #t~nondet878; [2025-03-08 19:08:11,311 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6503: havoc #t~mem137;havoc #t~bitwise138; [2025-03-08 19:08:11,411 INFO L1307 $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-08 19:08:11,411 INFO L1307 $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-08 19:08:11,793 INFO L1307 $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-08 19:08:21,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6510: havoc input_allocate_device_#t~ret146#1.base, input_allocate_device_#t~ret146#1.offset; [2025-03-08 19:08:21,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9289: havoc dvb_net_init_#t~nondet863#1; [2025-03-08 19:08:21,059 INFO L1307 $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-08 19:08:21,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9358: havoc request_firmware_#t~nondet872#1; [2025-03-08 19:08:21,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9362: havoc strlcat_#t~nondet873#1; [2025-03-08 19:08:21,059 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9296: havoc dvb_register_adapter_#t~nondet864#1; [2025-03-08 19:08:21,059 INFO L1307 $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-08 19:08:21,059 INFO L1307 $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-08 19:08:21,060 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9300: havoc dvb_register_frontend_#t~nondet865#1; [2025-03-08 19:08:21,060 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9371: havoc ttusbdecfe_dvbs_attach_#t~ret874#1.base, ttusbdecfe_dvbs_attach_#t~ret874#1.offset; [2025-03-08 19:08:21,060 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9308: havoc dvb_unregister_frontend_#t~nondet867#1; [2025-03-08 19:08:21,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9374: havoc ttusbdecfe_dvbt_attach_#t~ret875#1.base, ttusbdecfe_dvbt_attach_#t~ret875#1.offset; [2025-03-08 19:08:21,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9377: havoc usb_alloc_coherent_#t~ret876#1.base, usb_alloc_coherent_#t~ret876#1.offset; [2025-03-08 19:08:21,061 INFO L1307 $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-08 19:08:21,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9251: havoc crc32_le_#t~nondet857#1; [2025-03-08 19:08:21,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9318: havoc input_register_device_#t~nondet868#1; [2025-03-08 19:08:21,061 INFO L1307 $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-08 19:08:21,061 INFO L1307 $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-08 19:08:21,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9260: havoc dev_get_drvdata_#t~ret858#1.base, dev_get_drvdata_#t~ret858#1.offset; [2025-03-08 19:08:21,061 INFO L1307 $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-08 19:08:21,061 INFO L1307 $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-08 19:08:21,062 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9268: havoc dvb_dmx_init_#t~nondet860#1; [2025-03-08 19:08:21,062 INFO L1307 $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-08 19:08:21,062 INFO L1307 $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-08 19:08:21,062 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9275: havoc dvb_dmxdev_init_#t~nondet861#1; [2025-03-08 19:08:21,062 INFO L1307 $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-08 19:08:21,062 INFO L1307 $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-08 19:08:21,062 INFO L1307 $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-08 19:08:21,394 INFO L? ?]: Removed 1615 outVars from TransFormulas that were not future-live. [2025-03-08 19:08:21,394 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:08:21,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:08:21,443 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:08:21,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:08:21 BoogieIcfgContainer [2025-03-08 19:08:21,443 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:08:21,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:08:21,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:08:21,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:08:21,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:08:07" (1/3) ... [2025-03-08 19:08:21,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642fbf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:08:21, skipping insertion in model container [2025-03-08 19:08:21,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:08:09" (2/3) ... [2025-03-08 19:08:21,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642fbf0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:08:21, skipping insertion in model container [2025-03-08 19:08:21,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:08:21" (3/3) ... [2025-03-08 19:08:21,451 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-08 19:08:21,461 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:08:21,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.8-rc1-32_7a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-ldv_main0.cil.out.i that has 69 procedures, 1229 locations, 1 initial locations, 38 loop locations, and 1 error locations. [2025-03-08 19:08:21,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:08:21,536 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;@2274c461, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:08:21,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:08:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) [2025-03-08 19:08:21,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 19:08:21,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:21,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:21,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:21,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash 202142642, now seen corresponding path program 1 times [2025-03-08 19:08:21,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:21,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898454679] [2025-03-08 19:08:21,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:21,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:21,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 19:08:21,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 19:08:21,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:21,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:22,128 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-08 19:08:22,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:22,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898454679] [2025-03-08 19:08:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898454679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:22,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98324839] [2025-03-08 19:08:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:22,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:22,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:22,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:22,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:22,152 INFO L87 Difference]: Start difference. First operand has 1144 states, 820 states have (on average 1.3158536585365854) internal successors, (1079), 840 states have internal predecessors, (1079), 271 states have call successors, (271), 51 states have call predecessors, (271), 51 states have return successors, (271), 265 states have call predecessors, (271), 271 states have call successors, (271) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:24,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:08:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:24,338 INFO L93 Difference]: Finished difference Result 3399 states and 4915 transitions. [2025-03-08 19:08:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 19:08:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:24,359 INFO L225 Difference]: With dead ends: 3399 [2025-03-08 19:08:24,359 INFO L226 Difference]: Without dead ends: 2252 [2025-03-08 19:08:24,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:24,374 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1597 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 3231 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:24,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 3231 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 19:08:24,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2025-03-08 19:08:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2247. [2025-03-08 19:08:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2247 states, 1616 states have (on average 1.3044554455445545) internal successors, (2108), 1647 states have internal predecessors, (2108), 531 states have call successors, (531), 101 states have call predecessors, (531), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-08 19:08:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3171 transitions. [2025-03-08 19:08:24,554 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3171 transitions. Word has length 9 [2025-03-08 19:08:24,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:24,555 INFO L471 AbstractCegarLoop]: Abstraction has 2247 states and 3171 transitions. [2025-03-08 19:08:24,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:24,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3171 transitions. [2025-03-08 19:08:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 19:08:24,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:24,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:24,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:08:24,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1970239440, now seen corresponding path program 1 times [2025-03-08 19:08:24,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:24,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937600696] [2025-03-08 19:08:24,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:24,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:24,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 19:08:24,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 19:08:24,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:24,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:24,809 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-08 19:08:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937600696] [2025-03-08 19:08:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937600696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:24,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:24,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:24,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522989047] [2025-03-08 19:08:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:24,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:24,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:24,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:24,811 INFO L87 Difference]: Start difference. First operand 2247 states and 3171 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:26,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:08:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:27,030 INFO L93 Difference]: Finished difference Result 2249 states and 3172 transitions. [2025-03-08 19:08:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:27,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 19:08:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:27,043 INFO L225 Difference]: With dead ends: 2249 [2025-03-08 19:08:27,044 INFO L226 Difference]: Without dead ends: 2246 [2025-03-08 19:08:27,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:27,046 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 1589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:27,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 1579 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 19:08:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-03-08 19:08:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2025-03-08 19:08:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 1616 states have (on average 1.3038366336633664) internal successors, (2107), 1646 states have internal predecessors, (2107), 530 states have call successors, (530), 101 states have call predecessors, (530), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-08 19:08:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3169 transitions. [2025-03-08 19:08:27,128 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3169 transitions. Word has length 10 [2025-03-08 19:08:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:27,128 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 3169 transitions. [2025-03-08 19:08:27,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3169 transitions. [2025-03-08 19:08:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 19:08:27,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:27,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:08:27,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:27,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 946664307, now seen corresponding path program 1 times [2025-03-08 19:08:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721670849] [2025-03-08 19:08:27,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:27,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 19:08:27,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 19:08:27,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:27,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:27,362 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-08 19:08:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:27,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721670849] [2025-03-08 19:08:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721670849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672389076] [2025-03-08 19:08:27,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:27,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:27,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:27,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:27,363 INFO L87 Difference]: Start difference. First operand 2246 states and 3169 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:29,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:08:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:29,434 INFO L93 Difference]: Finished difference Result 2248 states and 3170 transitions. [2025-03-08 19:08:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 19:08:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:29,444 INFO L225 Difference]: With dead ends: 2248 [2025-03-08 19:08:29,444 INFO L226 Difference]: Without dead ends: 2245 [2025-03-08 19:08:29,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:29,446 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 1586 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:29,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 1577 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 19:08:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2025-03-08 19:08:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2245. [2025-03-08 19:08:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 1616 states have (on average 1.3032178217821782) internal successors, (2106), 1645 states have internal predecessors, (2106), 529 states have call successors, (529), 101 states have call predecessors, (529), 99 states have return successors, (532), 508 states have call predecessors, (532), 520 states have call successors, (532) [2025-03-08 19:08:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 3167 transitions. [2025-03-08 19:08:29,522 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 3167 transitions. Word has length 11 [2025-03-08 19:08:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:29,522 INFO L471 AbstractCegarLoop]: Abstraction has 2245 states and 3167 transitions. [2025-03-08 19:08:29,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 3167 transitions. [2025-03-08 19:08:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 19:08:29,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:29,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:29,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:08:29,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:29,524 INFO L85 PathProgramCache]: Analyzing trace with hash -719394767, now seen corresponding path program 1 times [2025-03-08 19:08:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:29,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769580110] [2025-03-08 19:08:29,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:29,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 19:08:29,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 19:08:29,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:29,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:29,738 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-08 19:08:29,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:29,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769580110] [2025-03-08 19:08:29,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769580110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:29,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:29,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:29,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932238639] [2025-03-08 19:08:29,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:29,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:29,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:29,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:29,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:29,740 INFO L87 Difference]: Start difference. First operand 2245 states and 3167 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:31,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:08:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:31,936 INFO L93 Difference]: Finished difference Result 6690 states and 9549 transitions. [2025-03-08 19:08:31,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:31,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 19:08:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:31,957 INFO L225 Difference]: With dead ends: 6690 [2025-03-08 19:08:31,957 INFO L226 Difference]: Without dead ends: 4443 [2025-03-08 19:08:31,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:31,969 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 1591 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 3180 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:31,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 3180 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 19:08:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2025-03-08 19:08:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 4421. [2025-03-08 19:08:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4421 states, 3191 states have (on average 1.3042933249764963) internal successors, (4162), 3247 states have internal predecessors, (4162), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-03-08 19:08:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 6294 transitions. [2025-03-08 19:08:32,163 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 6294 transitions. Word has length 12 [2025-03-08 19:08:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:32,163 INFO L471 AbstractCegarLoop]: Abstraction has 4421 states and 6294 transitions. [2025-03-08 19:08:32,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:08:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 6294 transitions. [2025-03-08 19:08:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 19:08:32,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:32,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:32,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:08:32,170 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:32,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2097492222, now seen corresponding path program 1 times [2025-03-08 19:08:32,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:32,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754883382] [2025-03-08 19:08:32,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:32,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 19:08:32,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 19:08:32,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:32,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:32,641 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-08 19:08:32,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:32,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754883382] [2025-03-08 19:08:32,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754883382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:32,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:32,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:32,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477254740] [2025-03-08 19:08:32,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:32,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:32,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:32,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:32,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:32,644 INFO L87 Difference]: Start difference. First operand 4421 states and 6294 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 19:08:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:32,911 INFO L93 Difference]: Finished difference Result 8886 states and 12656 transitions. [2025-03-08 19:08:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2025-03-08 19:08:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:32,936 INFO L225 Difference]: With dead ends: 8886 [2025-03-08 19:08:32,936 INFO L226 Difference]: Without dead ends: 4468 [2025-03-08 19:08:32,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:32,956 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 430 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:32,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2635 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2025-03-08 19:08:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 4457. [2025-03-08 19:08:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4457 states, 3227 states have (on average 1.305546947629377) internal successors, (4213), 3283 states have internal predecessors, (4213), 1034 states have call successors, (1034), 198 states have call predecessors, (1034), 195 states have return successors, (1098), 995 states have call predecessors, (1098), 1022 states have call successors, (1098) [2025-03-08 19:08:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4457 states to 4457 states and 6345 transitions. [2025-03-08 19:08:33,203 INFO L78 Accepts]: Start accepts. Automaton has 4457 states and 6345 transitions. Word has length 138 [2025-03-08 19:08:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:33,203 INFO L471 AbstractCegarLoop]: Abstraction has 4457 states and 6345 transitions. [2025-03-08 19:08:33,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 19:08:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4457 states and 6345 transitions. [2025-03-08 19:08:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 19:08:33,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:33,213 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:33,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:08:33,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:33,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -333994969, now seen corresponding path program 1 times [2025-03-08 19:08:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:33,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953506838] [2025-03-08 19:08:33,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:33,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 19:08:33,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 19:08:33,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:33,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:33,545 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-08 19:08:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953506838] [2025-03-08 19:08:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953506838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:33,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216283233] [2025-03-08 19:08:33,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:33,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:33,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:33,548 INFO L87 Difference]: Start difference. First operand 4457 states and 6345 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 19:08:33,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:33,752 INFO L93 Difference]: Finished difference Result 8691 states and 12367 transitions. [2025-03-08 19:08:33,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:33,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 156 [2025-03-08 19:08:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:33,777 INFO L225 Difference]: With dead ends: 8691 [2025-03-08 19:08:33,777 INFO L226 Difference]: Without dead ends: 4237 [2025-03-08 19:08:33,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:33,793 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 1471 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:33,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 1495 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2025-03-08 19:08:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 4237. [2025-03-08 19:08:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4237 states, 3047 states have (on average 1.3012799474893337) internal successors, (3965), 3103 states have internal predecessors, (3965), 994 states have call successors, (994), 198 states have call predecessors, (994), 195 states have return successors, (1054), 955 states have call predecessors, (1054), 982 states have call successors, (1054) [2025-03-08 19:08:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4237 states to 4237 states and 6013 transitions. [2025-03-08 19:08:33,978 INFO L78 Accepts]: Start accepts. Automaton has 4237 states and 6013 transitions. Word has length 156 [2025-03-08 19:08:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:33,979 INFO L471 AbstractCegarLoop]: Abstraction has 4237 states and 6013 transitions. [2025-03-08 19:08:33,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 19:08:33,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4237 states and 6013 transitions. [2025-03-08 19:08:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-08 19:08:33,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:33,986 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:33,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:08:33,987 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:33,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash -875364392, now seen corresponding path program 1 times [2025-03-08 19:08:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479766330] [2025-03-08 19:08:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:34,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-08 19:08:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-08 19:08:34,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:34,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 19:08:34,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:34,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479766330] [2025-03-08 19:08:34,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479766330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:34,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:34,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:08:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494780576] [2025-03-08 19:08:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:34,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:08:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:34,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:08:34,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:08:34,362 INFO L87 Difference]: Start difference. First operand 4237 states and 6013 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:08:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:34,548 INFO L93 Difference]: Finished difference Result 8487 states and 12042 transitions. [2025-03-08 19:08:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:08:34,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 174 [2025-03-08 19:08:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:34,568 INFO L225 Difference]: With dead ends: 8487 [2025-03-08 19:08:34,568 INFO L226 Difference]: Without dead ends: 4247 [2025-03-08 19:08:34,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:08:34,584 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 0 mSDsluCounter, 2984 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4480 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:34,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4480 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2025-03-08 19:08:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4247. [2025-03-08 19:08:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 3058 states have (on average 1.2998691955526487) internal successors, (3975), 3114 states have internal predecessors, (3975), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-08 19:08:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 6021 transitions. [2025-03-08 19:08:34,823 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 6021 transitions. Word has length 174 [2025-03-08 19:08:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:34,825 INFO L471 AbstractCegarLoop]: Abstraction has 4247 states and 6021 transitions. [2025-03-08 19:08:34,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:08:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 6021 transitions. [2025-03-08 19:08:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 19:08:34,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:34,835 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:34,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:08:34,835 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:34,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 107848569, now seen corresponding path program 1 times [2025-03-08 19:08:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881945320] [2025-03-08 19:08:34,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:34,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:35,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 19:08:35,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 19:08:35,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:35,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:35,566 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-08 19:08:35,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:35,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881945320] [2025-03-08 19:08:35,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881945320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:35,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:08:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625363782] [2025-03-08 19:08:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:35,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:08:35,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:08:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:35,569 INFO L87 Difference]: Start difference. First operand 4247 states and 6021 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:08:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:35,829 INFO L93 Difference]: Finished difference Result 8503 states and 12055 transitions. [2025-03-08 19:08:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:08:35,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 171 [2025-03-08 19:08:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:35,852 INFO L225 Difference]: With dead ends: 8503 [2025-03-08 19:08:35,852 INFO L226 Difference]: Without dead ends: 4259 [2025-03-08 19:08:35,868 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-08 19:08:35,868 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 0 mSDsluCounter, 4477 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:35,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5972 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-08 19:08:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2025-03-08 19:08:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3070 states have (on average 1.2986970684039087) internal successors, (3987), 3126 states have internal predecessors, (3987), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-08 19:08:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 6033 transitions. [2025-03-08 19:08:36,060 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 6033 transitions. Word has length 171 [2025-03-08 19:08:36,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:36,060 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 6033 transitions. [2025-03-08 19:08:36,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 19:08:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 6033 transitions. [2025-03-08 19:08:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 19:08:36,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:36,063 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:36,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:08:36,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:36,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -946110089, now seen corresponding path program 1 times [2025-03-08 19:08:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137476041] [2025-03-08 19:08:36,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:36,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:36,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 19:08:36,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 19:08:36,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:36,408 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-08 19:08:36,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:36,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137476041] [2025-03-08 19:08:36,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137476041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:36,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:36,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651875062] [2025-03-08 19:08:36,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:36,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:36,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:36,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:36,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:36,411 INFO L87 Difference]: Start difference. First operand 4259 states and 6033 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:08:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:36,586 INFO L93 Difference]: Finished difference Result 8543 states and 12107 transitions. [2025-03-08 19:08:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:36,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 180 [2025-03-08 19:08:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:36,612 INFO L225 Difference]: With dead ends: 8543 [2025-03-08 19:08:36,613 INFO L226 Difference]: Without dead ends: 4287 [2025-03-08 19:08:36,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:36,624 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 4 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:36,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2989 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2025-03-08 19:08:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 4263. [2025-03-08 19:08:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3074 states have (on average 1.2983083929733246) internal successors, (3991), 3130 states have internal predecessors, (3991), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-08 19:08:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6037 transitions. [2025-03-08 19:08:36,806 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6037 transitions. Word has length 180 [2025-03-08 19:08:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:36,807 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 6037 transitions. [2025-03-08 19:08:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:08:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6037 transitions. [2025-03-08 19:08:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-08 19:08:36,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:36,810 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:36,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:08:36,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -252602460, now seen corresponding path program 1 times [2025-03-08 19:08:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937373310] [2025-03-08 19:08:36,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 19:08:36,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 19:08:36,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:36,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:37,158 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-08 19:08:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:37,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937373310] [2025-03-08 19:08:37,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937373310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:37,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752081482] [2025-03-08 19:08:37,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:37,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:37,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:37,161 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:37,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:08:37,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 19:08:38,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 19:08:38,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:38,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:38,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:08:38,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:38,155 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-08 19:08:38,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:08:38,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752081482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:38,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:08:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:08:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159264947] [2025-03-08 19:08:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:38,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:38,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:38,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:38,159 INFO L87 Difference]: Start difference. First operand 4263 states and 6037 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:08:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:38,850 INFO L93 Difference]: Finished difference Result 8539 states and 12111 transitions. [2025-03-08 19:08:38,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 193 [2025-03-08 19:08:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:38,869 INFO L225 Difference]: With dead ends: 8539 [2025-03-08 19:08:38,869 INFO L226 Difference]: Without dead ends: 4279 [2025-03-08 19:08:38,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:38,881 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 4 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:38,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2987 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 19:08:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2025-03-08 19:08:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4267. [2025-03-08 19:08:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3078 states have (on average 1.297920727745289) internal successors, (3995), 3134 states have internal predecessors, (3995), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-08 19:08:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 6041 transitions. [2025-03-08 19:08:39,049 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 6041 transitions. Word has length 193 [2025-03-08 19:08:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:39,049 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 6041 transitions. [2025-03-08 19:08:39,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:08:39,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 6041 transitions. [2025-03-08 19:08:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 19:08:39,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:39,053 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:39,066 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-08 19:08:39,253 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-08 19:08:39,253 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1597054548, now seen corresponding path program 1 times [2025-03-08 19:08:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548690892] [2025-03-08 19:08:39,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:39,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 19:08:39,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 19:08:39,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:39,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:39,661 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 19:08:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548690892] [2025-03-08 19:08:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548690892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037666658] [2025-03-08 19:08:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:39,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:39,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:39,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:39,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:08:40,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 19:08:40,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 19:08:40,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:40,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:40,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 2598 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:08:40,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:40,643 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-08 19:08:40,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:08:40,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037666658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:08:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:08:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106927114] [2025-03-08 19:08:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:40,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:40,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:40,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:40,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:40,645 INFO L87 Difference]: Start difference. First operand 4267 states and 6041 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:08:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:40,791 INFO L93 Difference]: Finished difference Result 8539 states and 12107 transitions. [2025-03-08 19:08:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 196 [2025-03-08 19:08:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:40,810 INFO L225 Difference]: With dead ends: 8539 [2025-03-08 19:08:40,810 INFO L226 Difference]: Without dead ends: 4275 [2025-03-08 19:08:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:40,823 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 1 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:40,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2989 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-08 19:08:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4271. [2025-03-08 19:08:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4271 states, 3082 states have (on average 1.2975340687865022) internal successors, (3999), 3138 states have internal predecessors, (3999), 993 states have call successors, (993), 198 states have call predecessors, (993), 195 states have return successors, (1053), 954 states have call predecessors, (1053), 981 states have call successors, (1053) [2025-03-08 19:08:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 6045 transitions. [2025-03-08 19:08:40,984 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 6045 transitions. Word has length 196 [2025-03-08 19:08:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 4271 states and 6045 transitions. [2025-03-08 19:08:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 19:08:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 6045 transitions. [2025-03-08 19:08:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 19:08:40,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:40,987 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:41,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 19:08:41,188 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-08 19:08:41,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 594863977, now seen corresponding path program 1 times [2025-03-08 19:08:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:41,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092840973] [2025-03-08 19:08:41,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:41,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 19:08:41,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 19:08:41,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:41,599 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-08 19:08:41,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092840973] [2025-03-08 19:08:41,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092840973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:41,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217590118] [2025-03-08 19:08:41,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:41,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:41,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:41,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:08:42,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 19:08:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 19:08:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:42,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:08:42,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:42,713 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-08 19:08:42,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:08:42,840 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-08 19:08:42,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217590118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:08:42,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:08:42,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:08:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535691829] [2025-03-08 19:08:42,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:08:42,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:08:42,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:42,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:08:42,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:42,845 INFO L87 Difference]: Start difference. First operand 4271 states and 6045 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-08 19:08:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:43,023 INFO L93 Difference]: Finished difference Result 8627 states and 12223 transitions. [2025-03-08 19:08:43,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:08:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 198 [2025-03-08 19:08:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:43,042 INFO L225 Difference]: With dead ends: 8627 [2025-03-08 19:08:43,042 INFO L226 Difference]: Without dead ends: 4359 [2025-03-08 19:08:43,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:43,053 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 22 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:43,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2996 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2025-03-08 19:08:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 4319. [2025-03-08 19:08:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4319 states, 3118 states have (on average 1.2979474021808852) internal successors, (4047), 3174 states have internal predecessors, (4047), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1065), 966 states have call predecessors, (1065), 993 states have call successors, (1065) [2025-03-08 19:08:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4319 states to 4319 states and 6117 transitions. [2025-03-08 19:08:43,223 INFO L78 Accepts]: Start accepts. Automaton has 4319 states and 6117 transitions. Word has length 198 [2025-03-08 19:08:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:43,223 INFO L471 AbstractCegarLoop]: Abstraction has 4319 states and 6117 transitions. [2025-03-08 19:08:43,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 5 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-08 19:08:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4319 states and 6117 transitions. [2025-03-08 19:08:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-08 19:08:43,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:43,227 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:43,241 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-08 19:08:43,427 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-08 19:08:43,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash -271165642, now seen corresponding path program 2 times [2025-03-08 19:08:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083968839] [2025-03-08 19:08:43,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:08:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:43,602 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 237 statements into 2 equivalence classes. [2025-03-08 19:08:43,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 237 statements. [2025-03-08 19:08:43,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:08:43,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:43,736 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-08 19:08:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:43,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083968839] [2025-03-08 19:08:43,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083968839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:43,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:43,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:43,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765526956] [2025-03-08 19:08:43,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:43,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:43,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:43,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:43,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:43,738 INFO L87 Difference]: Start difference. First operand 4319 states and 6117 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:08:46,237 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-08 19:08:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:46,524 INFO L93 Difference]: Finished difference Result 8647 states and 12266 transitions. [2025-03-08 19:08:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 237 [2025-03-08 19:08:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:46,545 INFO L225 Difference]: With dead ends: 8647 [2025-03-08 19:08:46,546 INFO L226 Difference]: Without dead ends: 4331 [2025-03-08 19:08:46,560 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-08 19:08:46,561 INFO L435 NwaCegarLoop]: 2905 mSDtfsCounter, 1470 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 4389 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:46,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 4389 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 19:08:46,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2025-03-08 19:08:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4317. [2025-03-08 19:08:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4317 states, 3116 states have (on average 1.2968549422336328) internal successors, (4041), 3173 states have internal predecessors, (4041), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1041), 965 states have call predecessors, (1041), 993 states have call successors, (1041) [2025-03-08 19:08:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4317 states to 4317 states and 6087 transitions. [2025-03-08 19:08:46,768 INFO L78 Accepts]: Start accepts. Automaton has 4317 states and 6087 transitions. Word has length 237 [2025-03-08 19:08:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:46,769 INFO L471 AbstractCegarLoop]: Abstraction has 4317 states and 6087 transitions. [2025-03-08 19:08:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:08:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4317 states and 6087 transitions. [2025-03-08 19:08:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-08 19:08:46,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:46,773 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:46,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:08:46,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:46,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash -2076603976, now seen corresponding path program 1 times [2025-03-08 19:08:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:46,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898833059] [2025-03-08 19:08:46,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:46,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:46,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-08 19:08:46,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-08 19:08:46,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:46,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:47,136 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-08 19:08:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898833059] [2025-03-08 19:08:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898833059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842673477] [2025-03-08 19:08:47,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:47,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:47,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:47,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:47,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 19:08:47,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-08 19:08:48,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-08 19:08:48,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:48,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:48,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 2810 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:08:48,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:48,213 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-08 19:08:48,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:08:48,361 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-08 19:08:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842673477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:08:48,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:08:48,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:08:48,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8218016] [2025-03-08 19:08:48,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:08:48,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:08:48,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:48,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:08:48,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:48,362 INFO L87 Difference]: Start difference. First operand 4317 states and 6087 transitions. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 19:08:48,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:48,520 INFO L93 Difference]: Finished difference Result 8655 states and 12223 transitions. [2025-03-08 19:08:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:08:48,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 237 [2025-03-08 19:08:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:48,539 INFO L225 Difference]: With dead ends: 8655 [2025-03-08 19:08:48,539 INFO L226 Difference]: Without dead ends: 4341 [2025-03-08 19:08:48,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:48,550 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 2 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2989 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:48,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2989 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2025-03-08 19:08:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4341. [2025-03-08 19:08:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4341 states, 3140 states have (on average 1.2945859872611465) internal successors, (4065), 3197 states have internal predecessors, (4065), 1005 states have call successors, (1005), 198 states have call predecessors, (1005), 195 states have return successors, (1041), 965 states have call predecessors, (1041), 993 states have call successors, (1041) [2025-03-08 19:08:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 6111 transitions. [2025-03-08 19:08:48,699 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 6111 transitions. Word has length 237 [2025-03-08 19:08:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:48,701 INFO L471 AbstractCegarLoop]: Abstraction has 4341 states and 6111 transitions. [2025-03-08 19:08:48,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 19:08:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 6111 transitions. [2025-03-08 19:08:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-08 19:08:48,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:48,706 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:48,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 19:08:48,906 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-08 19:08:48,907 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:48,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1534187089, now seen corresponding path program 2 times [2025-03-08 19:08:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077132319] [2025-03-08 19:08:48,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:08:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:49,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 243 statements into 2 equivalence classes. [2025-03-08 19:08:49,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 57 of 243 statements. [2025-03-08 19:08:49,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:08:49,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:49,254 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-08 19:08:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077132319] [2025-03-08 19:08:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077132319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:08:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245231597] [2025-03-08 19:08:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:49,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:08:49,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:49,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:08:49,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:49,256 INFO L87 Difference]: Start difference. First operand 4341 states and 6111 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:08:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:49,438 INFO L93 Difference]: Finished difference Result 4365 states and 6132 transitions. [2025-03-08 19:08:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:08:49,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 243 [2025-03-08 19:08:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:49,456 INFO L225 Difference]: With dead ends: 4365 [2025-03-08 19:08:49,456 INFO L226 Difference]: Without dead ends: 4259 [2025-03-08 19:08:49,459 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-08 19:08:49,459 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 1 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5978 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:49,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5978 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2025-03-08 19:08:49,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2025-03-08 19:08:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 3086 states have (on average 1.2926117952041478) internal successors, (3989), 3137 states have internal predecessors, (3989), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-08 19:08:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 5983 transitions. [2025-03-08 19:08:49,591 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 5983 transitions. Word has length 243 [2025-03-08 19:08:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:49,593 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 5983 transitions. [2025-03-08 19:08:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-08 19:08:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 5983 transitions. [2025-03-08 19:08:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-08 19:08:49,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:49,598 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 19:08:49,599 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -892716651, now seen corresponding path program 1 times [2025-03-08 19:08:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628106115] [2025-03-08 19:08:49,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:49,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 19:08:49,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 19:08:49,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:49,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:49,957 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-08 19:08:49,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:49,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628106115] [2025-03-08 19:08:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628106115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:49,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:49,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:49,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392867040] [2025-03-08 19:08:49,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:49,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:49,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:49,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:49,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:49,959 INFO L87 Difference]: Start difference. First operand 4259 states and 5983 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 19:08:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:50,155 INFO L93 Difference]: Finished difference Result 8531 states and 11995 transitions. [2025-03-08 19:08:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:50,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 261 [2025-03-08 19:08:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:50,177 INFO L225 Difference]: With dead ends: 8531 [2025-03-08 19:08:50,177 INFO L226 Difference]: Without dead ends: 4275 [2025-03-08 19:08:50,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:50,188 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:50,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2983 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:50,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-08 19:08:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4263. [2025-03-08 19:08:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 3090 states have (on average 1.2922330097087378) internal successors, (3993), 3141 states have internal predecessors, (3993), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-08 19:08:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 5987 transitions. [2025-03-08 19:08:50,329 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 5987 transitions. Word has length 261 [2025-03-08 19:08:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:50,330 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 5987 transitions. [2025-03-08 19:08:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 19:08:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 5987 transitions. [2025-03-08 19:08:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 19:08:50,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:50,334 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:50,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 19:08:50,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:50,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1827817539, now seen corresponding path program 1 times [2025-03-08 19:08:50,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:50,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309909705] [2025-03-08 19:08:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:50,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 19:08:50,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 19:08:50,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:50,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:50,700 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-08 19:08:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309909705] [2025-03-08 19:08:50,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309909705] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:50,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808170064] [2025-03-08 19:08:50,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:50,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:50,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:50,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 19:08:51,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 19:08:51,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 19:08:51,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:51,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:51,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 2772 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:08:51,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:51,821 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-08 19:08:51,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:08:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808170064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:51,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:08:51,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:08:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682675425] [2025-03-08 19:08:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:51,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:51,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:51,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:51,824 INFO L87 Difference]: Start difference. First operand 4263 states and 5987 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 19:08:51,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:51,968 INFO L93 Difference]: Finished difference Result 8539 states and 12011 transitions. [2025-03-08 19:08:51,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 268 [2025-03-08 19:08:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:51,988 INFO L225 Difference]: With dead ends: 8539 [2025-03-08 19:08:51,989 INFO L226 Difference]: Without dead ends: 4279 [2025-03-08 19:08:51,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:08:52,000 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 2 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:52,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2983 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:52,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4279 states. [2025-03-08 19:08:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4279 to 4267. [2025-03-08 19:08:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4267 states, 3094 states have (on average 1.2918552036199096) internal successors, (3997), 3145 states have internal predecessors, (3997), 977 states have call successors, (977), 197 states have call predecessors, (977), 195 states have return successors, (1017), 944 states have call predecessors, (1017), 969 states have call successors, (1017) [2025-03-08 19:08:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 5991 transitions. [2025-03-08 19:08:52,201 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 5991 transitions. Word has length 268 [2025-03-08 19:08:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:52,201 INFO L471 AbstractCegarLoop]: Abstraction has 4267 states and 5991 transitions. [2025-03-08 19:08:52,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 19:08:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 5991 transitions. [2025-03-08 19:08:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 19:08:52,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:52,206 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:52,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 19:08:52,406 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-08 19:08:52,407 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:52,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1847774947, now seen corresponding path program 1 times [2025-03-08 19:08:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:52,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411965326] [2025-03-08 19:08:52,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:52,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 19:08:52,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 19:08:52,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:52,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:52,747 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-08 19:08:52,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411965326] [2025-03-08 19:08:52,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411965326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:52,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023148762] [2025-03-08 19:08:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:52,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:52,750 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:08:52,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 19:08:53,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 19:08:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 19:08:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:53,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 2791 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:08:53,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:53,787 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-08 19:08:53,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:08:53,969 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-08 19:08:53,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023148762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:08:53,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:08:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:08:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622359845] [2025-03-08 19:08:53,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:08:53,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:08:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:53,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:08:53,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:53,972 INFO L87 Difference]: Start difference. First operand 4267 states and 5991 transitions. Second operand has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-03-08 19:08:54,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:54,200 INFO L93 Difference]: Finished difference Result 8579 states and 12059 transitions. [2025-03-08 19:08:54,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:08:54,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) Word has length 275 [2025-03-08 19:08:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:54,221 INFO L225 Difference]: With dead ends: 8579 [2025-03-08 19:08:54,221 INFO L226 Difference]: Without dead ends: 4315 [2025-03-08 19:08:54,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:54,228 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 4 mSDsluCounter, 5956 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:54,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7449 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:08:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4315 states. [2025-03-08 19:08:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4315 to 4315. [2025-03-08 19:08:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4315 states, 3130 states have (on average 1.2884984025559105) internal successors, (4033), 3181 states have internal predecessors, (4033), 989 states have call successors, (989), 197 states have call predecessors, (989), 195 states have return successors, (1029), 956 states have call predecessors, (1029), 981 states have call successors, (1029) [2025-03-08 19:08:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4315 states to 4315 states and 6051 transitions. [2025-03-08 19:08:54,352 INFO L78 Accepts]: Start accepts. Automaton has 4315 states and 6051 transitions. Word has length 275 [2025-03-08 19:08:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:54,353 INFO L471 AbstractCegarLoop]: Abstraction has 4315 states and 6051 transitions. [2025-03-08 19:08:54,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 5 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (41), 5 states have call predecessors, (41), 5 states have call successors, (41) [2025-03-08 19:08:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4315 states and 6051 transitions. [2025-03-08 19:08:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 19:08:54,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:54,360 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:54,373 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-08 19:08:54,560 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-08 19:08:54,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:54,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:54,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1344479477, now seen corresponding path program 2 times [2025-03-08 19:08:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:54,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053497924] [2025-03-08 19:08:54,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:08:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:54,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 296 statements into 2 equivalence classes. [2025-03-08 19:08:54,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 296 statements. [2025-03-08 19:08:54,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:08:54,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:54,781 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-08 19:08:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053497924] [2025-03-08 19:08:54,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053497924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:08:54,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:08:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:08:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764142300] [2025-03-08 19:08:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:08:54,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:08:54,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:54,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:08:54,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:08:54,783 INFO L87 Difference]: Start difference. First operand 4315 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 19:08:57,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:08:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:57,733 INFO L93 Difference]: Finished difference Result 8632 states and 12103 transitions. [2025-03-08 19:08:57,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:08:57,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 296 [2025-03-08 19:08:57,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:57,752 INFO L225 Difference]: With dead ends: 8632 [2025-03-08 19:08:57,753 INFO L226 Difference]: Without dead ends: 4320 [2025-03-08 19:08:57,762 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-08 19:08:57,763 INFO L435 NwaCegarLoop]: 2883 mSDtfsCounter, 1473 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 4367 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:57,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 4367 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 19:08:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4320 states. [2025-03-08 19:08:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4320 to 4302. [2025-03-08 19:08:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 3119 states have (on average 1.2879127925617184) internal successors, (4017), 3172 states have internal predecessors, (4017), 987 states have call successors, (987), 196 states have call predecessors, (987), 195 states have return successors, (1005), 953 states have call predecessors, (1005), 969 states have call successors, (1005) [2025-03-08 19:08:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 6009 transitions. [2025-03-08 19:08:57,989 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 6009 transitions. Word has length 296 [2025-03-08 19:08:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:08:57,989 INFO L471 AbstractCegarLoop]: Abstraction has 4302 states and 6009 transitions. [2025-03-08 19:08:57,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 3 states have call successors, (30), 3 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 19:08:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 6009 transitions. [2025-03-08 19:08:57,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 19:08:57,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:08:57,995 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:08:57,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 19:08:57,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:08:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:08:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1637882484, now seen corresponding path program 1 times [2025-03-08 19:08:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:08:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632987699] [2025-03-08 19:08:57,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:08:58,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 19:08:58,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 19:08:58,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:58,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:58,401 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-08 19:08:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:08:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632987699] [2025-03-08 19:08:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632987699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:08:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679478066] [2025-03-08 19:08:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:08:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:08:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:08:58,404 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-08 19:08:58,405 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-08 19:08:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 19:08:59,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 19:08:59,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:08:59,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:08:59,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 2847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:08:59,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:08:59,529 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-08 19:08:59,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:08:59,680 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-08 19:08:59,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679478066] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:08:59,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:08:59,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:08:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309758058] [2025-03-08 19:08:59,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:08:59,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:08:59,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:08:59,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:08:59,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:59,682 INFO L87 Difference]: Start difference. First operand 4302 states and 6009 transitions. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-08 19:08:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:08:59,822 INFO L93 Difference]: Finished difference Result 8649 states and 12103 transitions. [2025-03-08 19:08:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:08:59,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 296 [2025-03-08 19:08:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:08:59,884 INFO L225 Difference]: With dead ends: 8649 [2025-03-08 19:08:59,884 INFO L226 Difference]: Without dead ends: 4350 [2025-03-08 19:08:59,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:08:59,893 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 4 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4471 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:08:59,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4471 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:08:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4350 states. [2025-03-08 19:08:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4350 to 4350. [2025-03-08 19:09:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4350 states, 3155 states have (on average 1.2846275752773375) internal successors, (4053), 3208 states have internal predecessors, (4053), 999 states have call successors, (999), 196 states have call predecessors, (999), 195 states have return successors, (1017), 965 states have call predecessors, (1017), 981 states have call successors, (1017) [2025-03-08 19:09:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4350 states to 4350 states and 6069 transitions. [2025-03-08 19:09:00,025 INFO L78 Accepts]: Start accepts. Automaton has 4350 states and 6069 transitions. Word has length 296 [2025-03-08 19:09:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:00,026 INFO L471 AbstractCegarLoop]: Abstraction has 4350 states and 6069 transitions. [2025-03-08 19:09:00,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 5 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2025-03-08 19:09:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4350 states and 6069 transitions. [2025-03-08 19:09:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2025-03-08 19:09:00,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:00,032 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:00,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 19:09:00,233 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-08 19:09:00,233 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 240574230, now seen corresponding path program 2 times [2025-03-08 19:09:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018018168] [2025-03-08 19:09:00,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:09:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:00,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 317 statements into 2 equivalence classes. [2025-03-08 19:09:00,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 317 statements. [2025-03-08 19:09:00,391 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 19:09:00,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:00,525 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-08 19:09:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018018168] [2025-03-08 19:09:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018018168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:09:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975708271] [2025-03-08 19:09:00,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:09:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:00,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:09:00,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:09:00,528 INFO L87 Difference]: Start difference. First operand 4350 states and 6069 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 19:09:00,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:00,675 INFO L93 Difference]: Finished difference Result 4361 states and 6077 transitions. [2025-03-08 19:09:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:09:00,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) Word has length 317 [2025-03-08 19:09:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:00,695 INFO L225 Difference]: With dead ends: 4361 [2025-03-08 19:09:00,695 INFO L226 Difference]: Without dead ends: 4338 [2025-03-08 19:09:00,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:09:00,698 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 0 mSDsluCounter, 5982 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7481 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:00,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7481 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:09:00,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2025-03-08 19:09:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2025-03-08 19:09:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 3146 states have (on average 1.2835346471710107) internal successors, (4038), 3198 states have internal predecessors, (4038), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-08 19:09:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6049 transitions. [2025-03-08 19:09:00,826 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6049 transitions. Word has length 317 [2025-03-08 19:09:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:00,828 INFO L471 AbstractCegarLoop]: Abstraction has 4338 states and 6049 transitions. [2025-03-08 19:09:00,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 5 states have internal predecessors, (167), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (27), 2 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 19:09:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6049 transitions. [2025-03-08 19:09:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 19:09:00,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:00,833 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:00,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 19:09:00,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:00,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 618137173, now seen corresponding path program 1 times [2025-03-08 19:09:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:00,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676167363] [2025-03-08 19:09:00,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:00,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:01,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 19:09:01,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 19:09:01,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:01,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:01,270 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-08 19:09:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676167363] [2025-03-08 19:09:01,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676167363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:09:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074215777] [2025-03-08 19:09:01,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:09:01,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:09:01,273 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-08 19:09:01,274 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-08 19:09:02,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 19:09:02,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 19:09:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:02,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:09:02,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:09:02,453 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-08 19:09:02,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:09:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074215777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:09:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 19:09:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521835685] [2025-03-08 19:09:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:09:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:02,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:09:02,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:09:02,459 INFO L87 Difference]: Start difference. First operand 4338 states and 6049 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 19:09:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:02,600 INFO L93 Difference]: Finished difference Result 8681 states and 12107 transitions. [2025-03-08 19:09:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:09:02,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 311 [2025-03-08 19:09:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:02,619 INFO L225 Difference]: With dead ends: 8681 [2025-03-08 19:09:02,620 INFO L226 Difference]: Without dead ends: 4346 [2025-03-08 19:09:02,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:09:02,631 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 0 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:02,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2979 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:09:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2025-03-08 19:09:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4346. [2025-03-08 19:09:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4346 states, 3154 states have (on average 1.2828154724159797) internal successors, (4046), 3206 states have internal predecessors, (4046), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-08 19:09:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6057 transitions. [2025-03-08 19:09:02,758 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6057 transitions. Word has length 311 [2025-03-08 19:09:02,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:02,759 INFO L471 AbstractCegarLoop]: Abstraction has 4346 states and 6057 transitions. [2025-03-08 19:09:02,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 19:09:02,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6057 transitions. [2025-03-08 19:09:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 19:09:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:02,764 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:02,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 19:09:02,964 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-08 19:09:02,965 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:02,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 898487062, now seen corresponding path program 1 times [2025-03-08 19:09:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549114607] [2025-03-08 19:09:02,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:03,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 19:09:03,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 19:09:03,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:03,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:03,359 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-08 19:09:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549114607] [2025-03-08 19:09:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549114607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:09:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879933603] [2025-03-08 19:09:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:03,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:09:03,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:09:03,361 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-08 19:09:03,363 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-08 19:09:04,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 19:09:04,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 19:09:04,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:04,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:04,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 3320 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:09:04,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:09:04,614 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-08 19:09:04,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:09:04,789 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-08 19:09:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879933603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:09:04,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:09:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:09:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768241041] [2025-03-08 19:09:04,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:09:04,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:09:04,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:04,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:09:04,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:09:04,790 INFO L87 Difference]: Start difference. First operand 4346 states and 6057 transitions. Second operand has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 19:09:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:05,544 INFO L93 Difference]: Finished difference Result 8821 states and 12279 transitions. [2025-03-08 19:09:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:09:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 311 [2025-03-08 19:09:05,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:05,564 INFO L225 Difference]: With dead ends: 8821 [2025-03-08 19:09:05,564 INFO L226 Difference]: Without dead ends: 4478 [2025-03-08 19:09:05,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:09:05,574 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 8 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:05,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5963 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 19:09:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4478 states. [2025-03-08 19:09:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4478 to 4478. [2025-03-08 19:09:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4478 states, 3286 states have (on average 1.2751065124771759) internal successors, (4190), 3338 states have internal predecessors, (4190), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-08 19:09:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4478 states to 4478 states and 6201 transitions. [2025-03-08 19:09:05,808 INFO L78 Accepts]: Start accepts. Automaton has 4478 states and 6201 transitions. Word has length 311 [2025-03-08 19:09:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:05,808 INFO L471 AbstractCegarLoop]: Abstraction has 4478 states and 6201 transitions. [2025-03-08 19:09:05,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 2 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-03-08 19:09:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4478 states and 6201 transitions. [2025-03-08 19:09:05,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-08 19:09:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:05,815 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:05,832 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-08 19:09:06,016 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-08 19:09:06,017 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:06,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1247948669, now seen corresponding path program 1 times [2025-03-08 19:09:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463409330] [2025-03-08 19:09:06,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:06,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-08 19:09:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-08 19:09:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:06,346 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-08 19:09:06,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463409330] [2025-03-08 19:09:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463409330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:06,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:06,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:09:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830763932] [2025-03-08 19:09:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:06,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:09:06,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:06,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:09:06,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:09:06,348 INFO L87 Difference]: Start difference. First operand 4478 states and 6201 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 19:09:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:06,471 INFO L93 Difference]: Finished difference Result 8949 states and 12395 transitions. [2025-03-08 19:09:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:09:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 340 [2025-03-08 19:09:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:06,491 INFO L225 Difference]: With dead ends: 8949 [2025-03-08 19:09:06,491 INFO L226 Difference]: Without dead ends: 4474 [2025-03-08 19:09:06,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:09:06,500 INFO L435 NwaCegarLoop]: 1493 mSDtfsCounter, 0 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:06,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2973 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:09:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4474 states. [2025-03-08 19:09:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4474 to 4474. [2025-03-08 19:09:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 3282 states have (on average 1.2742230347349177) internal successors, (4182), 3330 states have internal predecessors, (4182), 996 states have call successors, (996), 196 states have call predecessors, (996), 195 states have return successors, (1015), 963 states have call predecessors, (1015), 979 states have call successors, (1015) [2025-03-08 19:09:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 6193 transitions. [2025-03-08 19:09:06,629 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 6193 transitions. Word has length 340 [2025-03-08 19:09:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 4474 states and 6193 transitions. [2025-03-08 19:09:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 19:09:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 6193 transitions. [2025-03-08 19:09:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-08 19:09:06,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:06,636 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 19:09:06,636 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash 150675314, now seen corresponding path program 1 times [2025-03-08 19:09:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047700357] [2025-03-08 19:09:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:06,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-08 19:09:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-08 19:09:06,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:06,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:07,084 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-08 19:09:07,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:07,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047700357] [2025-03-08 19:09:07,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047700357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:07,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 19:09:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16559273] [2025-03-08 19:09:07,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:07,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 19:09:07,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:07,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 19:09:07,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:09:07,087 INFO L87 Difference]: Start difference. First operand 4474 states and 6193 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 19:09:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:07,249 INFO L93 Difference]: Finished difference Result 6617 states and 9164 transitions. [2025-03-08 19:09:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 19:09:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 357 [2025-03-08 19:09:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:07,273 INFO L225 Difference]: With dead ends: 6617 [2025-03-08 19:09:07,274 INFO L226 Difference]: Without dead ends: 4462 [2025-03-08 19:09:07,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:09:07,280 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 0 mSDsluCounter, 5958 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:07,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7449 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:09:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2025-03-08 19:09:07,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4462. [2025-03-08 19:09:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4462 states, 3272 states have (on average 1.2744498777506112) internal successors, (4170), 3322 states have internal predecessors, (4170), 996 states have call successors, (996), 196 states have call predecessors, (996), 193 states have return successors, (1011), 959 states have call predecessors, (1011), 979 states have call successors, (1011) [2025-03-08 19:09:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 6177 transitions. [2025-03-08 19:09:07,414 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 6177 transitions. Word has length 357 [2025-03-08 19:09:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:07,415 INFO L471 AbstractCegarLoop]: Abstraction has 4462 states and 6177 transitions. [2025-03-08 19:09:07,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 5 states have internal predecessors, (195), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-08 19:09:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 6177 transitions. [2025-03-08 19:09:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-08 19:09:07,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:07,420 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:07,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 19:09:07,420 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1564085318, now seen corresponding path program 1 times [2025-03-08 19:09:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477612383] [2025-03-08 19:09:07,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:07,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-08 19:09:07,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-08 19:09:07,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:07,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:07,804 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-08 19:09:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477612383] [2025-03-08 19:09:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477612383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:07,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:09:07,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041385060] [2025-03-08 19:09:07,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:07,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:09:07,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:07,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:09:07,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:09:07,806 INFO L87 Difference]: Start difference. First operand 4462 states and 6177 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 19:09:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:07,958 INFO L93 Difference]: Finished difference Result 4507 states and 6219 transitions. [2025-03-08 19:09:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:09:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 380 [2025-03-08 19:09:07,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:07,973 INFO L225 Difference]: With dead ends: 4507 [2025-03-08 19:09:07,974 INFO L226 Difference]: Without dead ends: 2330 [2025-03-08 19:09:07,978 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-08 19:09:07,979 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 0 mSDsluCounter, 4437 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5921 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:09:07,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5921 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:09:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-08 19:09:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2025-03-08 19:09:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1704 states have (on average 1.2705399061032865) internal successors, (2165), 1728 states have internal predecessors, (2165), 521 states have call successors, (521), 107 states have call predecessors, (521), 104 states have return successors, (514), 502 states have call predecessors, (514), 510 states have call successors, (514) [2025-03-08 19:09:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3200 transitions. [2025-03-08 19:09:08,046 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3200 transitions. Word has length 380 [2025-03-08 19:09:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3200 transitions. [2025-03-08 19:09:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 2 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-08 19:09:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3200 transitions. [2025-03-08 19:09:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-08 19:09:08,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:08,051 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:08,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 19:09:08,052 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -9271865, now seen corresponding path program 1 times [2025-03-08 19:09:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162307620] [2025-03-08 19:09:08,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:08,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-08 19:09:08,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-08 19:09:08,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:08,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:08,625 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-08 19:09:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162307620] [2025-03-08 19:09:08,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162307620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:08,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:08,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:09:08,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692131032] [2025-03-08 19:09:08,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:08,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:09:08,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:08,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:09:08,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:09:08,627 INFO L87 Difference]: Start difference. First operand 2330 states and 3200 transitions. Second operand has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 19:09:12,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:09:16,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:09:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:09:16,761 INFO L93 Difference]: Finished difference Result 4665 states and 6423 transitions. [2025-03-08 19:09:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:09:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) Word has length 392 [2025-03-08 19:09:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:09:16,774 INFO L225 Difference]: With dead ends: 4665 [2025-03-08 19:09:16,774 INFO L226 Difference]: Without dead ends: 2338 [2025-03-08 19:09:16,778 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-08 19:09:16,779 INFO L435 NwaCegarLoop]: 1485 mSDtfsCounter, 0 mSDsluCounter, 4445 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5930 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-08 19:09:16,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5930 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2025-03-08 19:09:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2025-03-08 19:09:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2338. [2025-03-08 19:09:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 1710 states have (on average 1.2695906432748538) internal successors, (2171), 1734 states have internal predecessors, (2171), 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-08 19:09:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3224 transitions. [2025-03-08 19:09:16,843 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3224 transitions. Word has length 392 [2025-03-08 19:09:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:09:16,843 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3224 transitions. [2025-03-08 19:09:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.4) internal successors, (207), 4 states have internal predecessors, (207), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (36), 3 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-08 19:09:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3224 transitions. [2025-03-08 19:09:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-03-08 19:09:16,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:09:16,847 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:09:16,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 19:09:16,847 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:09:16,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:09:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1522530639, now seen corresponding path program 1 times [2025-03-08 19:09:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:09:16,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141326259] [2025-03-08 19:09:16,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:09:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:09:17,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-03-08 19:09:17,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-03-08 19:09:17,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:09:17,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:09:17,508 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-08 19:09:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:09:17,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141326259] [2025-03-08 19:09:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141326259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:09:17,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:09:17,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 19:09:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502515804] [2025-03-08 19:09:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:09:17,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 19:09:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:09:17,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 19:09:17,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 19:09:17,510 INFO L87 Difference]: Start difference. First operand 2338 states and 3224 transitions. Second operand has 8 states, 8 states have (on average 27.375) internal successors, (219), 7 states have internal predecessors, (219), 3 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-08 19:09:21,632 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 []