./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:22:04,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:22:04,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:22:04,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:22:04,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:22:04,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:22:04,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:22:04,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:22:04,253 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:22:04,253 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:22:04,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:22:04,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:22:04,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:22:04,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:22:04,253 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:22:04,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:22:04,254 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:22:04,255 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:22:04,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:22:04,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:22:04,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:22:04,256 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:22:04,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:22:04,256 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2025-02-06 06:22:04,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:22:04,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:22:04,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:22:04,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:22:04,462 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:22:04,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-02-06 06:22:05,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494d6a46d/febb8c378c8e4cf887dd3645ecd93631/FLAG10f6614df [2025-02-06 06:22:06,154 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:22:06,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-02-06 06:22:06,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494d6a46d/febb8c378c8e4cf887dd3645ecd93631/FLAG10f6614df [2025-02-06 06:22:06,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/494d6a46d/febb8c378c8e4cf887dd3645ecd93631 [2025-02-06 06:22:06,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:22:06,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:22:06,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:06,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:22:06,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:22:06,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:06" (1/1) ... [2025-02-06 06:22:06,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f220eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:06, skipping insertion in model container [2025-02-06 06:22:06,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:22:06" (1/1) ... [2025-02-06 06:22:06,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:22:06,847 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-02-06 06:22:07,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:07,164 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:22:07,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2025-02-06 06:22:07,324 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"); [5440] [2025-02-06 06:22:07,324 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5447] [2025-02-06 06:22:07,325 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5455-5456] [2025-02-06 06:22:07,327 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; incl %0": "+m" (v->counter)); [5484] [2025-02-06 06:22:07,327 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; decl %0": "+m" (v->counter)); [5491] [2025-02-06 06:22:07,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-02-06 06:22:07,385 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/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6228/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/usb_8dev.o.c.prepared"), "i" (621), "i" (12UL)); [6324-6325] [2025-02-06 06:22:07,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:22:07,491 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:22:07,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07 WrapperNode [2025-02-06 06:22:07,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:22:07,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:07,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:22:07,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:22:07,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,692 INFO L138 Inliner]: procedures = 174, calls = 830, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2590 [2025-02-06 06:22:07,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:22:07,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:22:07,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:22:07,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:22:07,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,887 INFO L175 MemorySlicer]: Split 464 memory accesses to 8 slices as follows [2, 341, 1, 31, 9, 44, 31, 5]. 73 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 26, 0, 0, 0, 0, 0, 0]. The 249 writes are split as follows [0, 186, 0, 0, 0, 44, 18, 1]. [2025-02-06 06:22:07,890 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,953 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:22:07,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:22:07,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:22:07,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:22:07,996 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (1/1) ... [2025-02-06 06:22:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:22:08,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:08,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:22:08,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-02-06 06:22:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-02-06 06:22:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-02-06 06:22:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2025-02-06 06:22:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-02-06 06:22:08,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:22:08,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-02-06 06:22:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:22:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 06:22:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-02-06 06:22:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-02-06 06:22:08,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-02-06 06:22:08,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:22:08,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-02-06 06:22:08,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-02-06 06:22:08,041 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2025-02-06 06:22:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-02-06 06:22:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-02-06 06:22:08,042 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:22:08,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:22:08,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:22:08,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-02-06 06:22:08,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-02-06 06:22:08,044 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 06:22:08,045 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 06:22:08,045 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-02-06 06:22:08,047 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:22:08,047 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2025-02-06 06:22:08,048 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2025-02-06 06:22:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:22:08,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:22:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:22:08,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:22:08,048 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2025-02-06 06:22:08,048 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2025-02-06 06:22:08,426 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:22:08,429 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:22:08,500 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7476: havoc #t~nondet487; [2025-02-06 06:22:08,533 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:22:08,566 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5463: havoc constant_test_bit_#t~mem14#1;havoc constant_test_bit_#t~bitwise15#1; [2025-02-06 06:22:08,595 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5570: havoc #t~mem63;havoc #t~bitwise64; [2025-02-06 06:22:08,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc alloc_can_err_skb_#t~ret471#1.base, alloc_can_err_skb_#t~ret471#1.offset; [2025-02-06 06:22:08,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6198: call ULTIMATE.dealloc(usb_8dev_rx_can_msg_~#cf~1#1.base, usb_8dev_rx_can_msg_~#cf~1#1.offset);havoc usb_8dev_rx_can_msg_~#cf~1#1.base, usb_8dev_rx_can_msg_~#cf~1#1.offset; [2025-02-06 06:22:08,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6084: call ULTIMATE.dealloc(usb_8dev_rx_err_msg_~#cf~0#1.base, usb_8dev_rx_err_msg_~#cf~0#1.offset);havoc usb_8dev_rx_err_msg_~#cf~0#1.base, usb_8dev_rx_err_msg_~#cf~0#1.offset; [2025-02-06 06:22:08,944 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_can_skb_#t~ret472#1.base, alloc_can_skb_#t~ret472#1.offset; [2025-02-06 06:22:08,958 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5527: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-02-06 06:22:09,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7459: havoc printk_#t~nondet484#1; [2025-02-06 06:22:09,247 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet478; [2025-02-06 06:22:09,283 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-02-06 06:22:09,449 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7451: havoc netpoll_trap_#t~nondet482#1; [2025-02-06 06:22:09,449 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc can_get_echo_skb_#t~nondet474#1; [2025-02-06 06:22:09,454 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~ret486.base, #t~ret486.offset; [2025-02-06 06:22:09,457 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7447: havoc #t~nondet481; [2025-02-06 06:22:09,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc #t~nondet480; [2025-02-06 06:22:09,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc #t~mem79.base, #t~mem79.offset; [2025-02-06 06:22:09,484 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc #t~nondet479; [2025-02-06 06:22:09,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5867: call ULTIMATE.dealloc(usb_8dev_send_cmd_msg_~#actual_length~0#1.base, usb_8dev_send_cmd_msg_~#actual_length~0#1.offset);havoc usb_8dev_send_cmd_msg_~#actual_length~0#1.base, usb_8dev_send_cmd_msg_~#actual_length~0#1.offset; [2025-02-06 06:22:09,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5893: call ULTIMATE.dealloc(~#num_bytes_read~0#1.base, ~#num_bytes_read~0#1.offset);havoc ~#num_bytes_read~0#1.base, ~#num_bytes_read~0#1.offset; [2025-02-06 06:22:15,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7402: havoc dev_err_#t~nondet475#1; [2025-02-06 06:22:15,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7376: havoc alloc_candev_#t~ret473#1.base, alloc_candev_#t~ret473#1.offset; [2025-02-06 06:22:15,865 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027: call ULTIMATE.dealloc(usb_8dev_cmd_version_~#inmsg~2#1.base, usb_8dev_cmd_version_~#inmsg~2#1.offset);havoc usb_8dev_cmd_version_~#inmsg~2#1.base, usb_8dev_cmd_version_~#inmsg~2#1.offset;call ULTIMATE.dealloc(usb_8dev_cmd_version_~#outmsg~2#1.base, usb_8dev_cmd_version_~#outmsg~2#1.offset);havoc usb_8dev_cmd_version_~#outmsg~2#1.base, usb_8dev_cmd_version_~#outmsg~2#1.offset; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc ldv_ndo_init_2_#t~nondet476#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc atomic_read_#t~mem19#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: call ULTIMATE.dealloc(usb_8dev_cmd_close_~#inmsg~1#1.base, usb_8dev_cmd_close_~#inmsg~1#1.offset);havoc usb_8dev_cmd_close_~#inmsg~1#1.base, usb_8dev_cmd_close_~#inmsg~1#1.offset;call ULTIMATE.dealloc(usb_8dev_cmd_close_~#outmsg~1#1.base, usb_8dev_cmd_close_~#outmsg~1#1.offset);havoc usb_8dev_cmd_close_~#outmsg~1#1.base, usb_8dev_cmd_close_~#outmsg~1#1.offset; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6662: call ULTIMATE.dealloc(usb_8dev_probe_~#version~0#1.base, usb_8dev_probe_~#version~0#1.offset);havoc usb_8dev_probe_~#version~0#1.base, usb_8dev_probe_~#version~0#1.offset;call ULTIMATE.dealloc(usb_8dev_probe_~#buf~2#1.base, usb_8dev_probe_~#buf~2#1.offset);havoc usb_8dev_probe_~#buf~2#1.base, usb_8dev_probe_~#buf~2#1.offset;call ULTIMATE.dealloc(usb_8dev_probe_~#__key~1#1.base, usb_8dev_probe_~#__key~1#1.offset);havoc usb_8dev_probe_~#__key~1#1.base, usb_8dev_probe_~#__key~1#1.offset; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: havoc ldv_ndo_uninit_2_#t~nondet477#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: havoc open_candev_#t~nondet483#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7489: havoc usb_register_driver_#t~nondet488#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc usb_string_#t~nondet489#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc register_candev_#t~nondet485#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc _dev_info_#t~nondet470#1; [2025-02-06 06:22:15,866 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5584: havoc __kmalloc_#t~ret67#1.base, __kmalloc_#t~ret67#1.offset; [2025-02-06 06:22:16,128 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5941: call ULTIMATE.dealloc(~#outmsg~0#1.base, ~#outmsg~0#1.offset);havoc ~#outmsg~0#1.base, ~#outmsg~0#1.offset;call ULTIMATE.dealloc(~#inmsg~0#1.base, ~#inmsg~0#1.offset);havoc ~#inmsg~0#1.base, ~#inmsg~0#1.offset;call ULTIMATE.dealloc(~#beflags~0#1.base, ~#beflags~0#1.offset);havoc ~#beflags~0#1.base, ~#beflags~0#1.offset;call ULTIMATE.dealloc(~#bebrp~0#1.base, ~#bebrp~0#1.offset);havoc ~#bebrp~0#1.base, ~#bebrp~0#1.offset; [2025-02-06 06:22:16,129 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc __fswab16_#t~bitwise9#1; [2025-02-06 06:22:16,399 INFO L? ?]: Removed 1198 outVars from TransFormulas that were not future-live. [2025-02-06 06:22:16,399 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:22:16,452 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:22:16,452 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:22:16,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:16 BoogieIcfgContainer [2025-02-06 06:22:16,453 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:22:16,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:22:16,454 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:22:16,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:22:16,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:22:06" (1/3) ... [2025-02-06 06:22:16,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcda6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:16, skipping insertion in model container [2025-02-06 06:22:16,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:22:07" (2/3) ... [2025-02-06 06:22:16,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcda6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:16, skipping insertion in model container [2025-02-06 06:22:16,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:16" (3/3) ... [2025-02-06 06:22:16,461 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-02-06 06:22:16,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:22:16,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i that has 62 procedures, 876 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-02-06 06:22:16,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:22:16,534 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;@14b4568a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:22:16,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:22:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 814 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 632 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-06 06:22:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 06:22:16,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:16,544 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-06 06:22:16,544 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:16,548 INFO L85 PathProgramCache]: Analyzing trace with hash 553437365, now seen corresponding path program 1 times [2025-02-06 06:22:16,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:16,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402860165] [2025-02-06 06:22:16,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:16,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:17,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 06:22:18,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 06:22:18,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:18,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:22:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402860165] [2025-02-06 06:22:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402860165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:18,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194402314] [2025-02-06 06:22:18,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:18,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:18,378 INFO L87 Difference]: Start difference. First operand has 814 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 632 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:22:22,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:22,970 INFO L93 Difference]: Finished difference Result 2397 states and 3367 transitions. [2025-02-06 06:22:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-02-06 06:22:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:22,988 INFO L225 Difference]: With dead ends: 2397 [2025-02-06 06:22:22,988 INFO L226 Difference]: Without dead ends: 1559 [2025-02-06 06:22:22,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:22,996 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 1048 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:22,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2119 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-02-06 06:22:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-02-06 06:22:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1181 states have (on average 1.2921253175275191) internal successors, (1526), 1201 states have internal predecessors, (1526), 289 states have call successors, (289), 89 states have call predecessors, (289), 88 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2025-02-06 06:22:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2099 transitions. [2025-02-06 06:22:23,098 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2099 transitions. Word has length 28 [2025-02-06 06:22:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:23,098 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2099 transitions. [2025-02-06 06:22:23,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 06:22:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2099 transitions. [2025-02-06 06:22:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 06:22:23,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:23,101 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:23,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:22:23,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1712736568, now seen corresponding path program 1 times [2025-02-06 06:22:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962960116] [2025-02-06 06:22:23,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:24,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 06:22:24,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 06:22:24,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:24,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962960116] [2025-02-06 06:22:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962960116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414961393] [2025-02-06 06:22:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:24,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:24,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:24,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:24,885 INFO L87 Difference]: Start difference. First operand 1559 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:25,589 INFO L93 Difference]: Finished difference Result 4662 states and 6302 transitions. [2025-02-06 06:22:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-02-06 06:22:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:25,603 INFO L225 Difference]: With dead ends: 4662 [2025-02-06 06:22:25,604 INFO L226 Difference]: Without dead ends: 3110 [2025-02-06 06:22:25,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:25,609 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 1044 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:25,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 2567 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:22:25,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-02-06 06:22:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3100. [2025-02-06 06:22:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2352 states have (on average 1.2908163265306123) internal successors, (3036), 2388 states have internal predecessors, (3036), 571 states have call successors, (571), 177 states have call predecessors, (571), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-02-06 06:22:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4187 transitions. [2025-02-06 06:22:25,750 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4187 transitions. Word has length 38 [2025-02-06 06:22:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:25,750 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4187 transitions. [2025-02-06 06:22:25,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4187 transitions. [2025-02-06 06:22:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 06:22:25,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:25,754 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:25,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:22:25,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1554490554, now seen corresponding path program 1 times [2025-02-06 06:22:25,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:25,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285904621] [2025-02-06 06:22:25,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:25,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:26,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 06:22:26,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 06:22:26,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:26,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285904621] [2025-02-06 06:22:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285904621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404240877] [2025-02-06 06:22:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:27,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:27,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:27,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:27,204 INFO L87 Difference]: Start difference. First operand 3100 states and 4187 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:27,409 INFO L93 Difference]: Finished difference Result 3102 states and 4188 transitions. [2025-02-06 06:22:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-06 06:22:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:27,421 INFO L225 Difference]: With dead ends: 3102 [2025-02-06 06:22:27,421 INFO L226 Difference]: Without dead ends: 3099 [2025-02-06 06:22:27,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:27,423 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 1045 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:27,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1039 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-02-06 06:22:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3099. [2025-02-06 06:22:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2352 states have (on average 1.290391156462585) internal successors, (3035), 2387 states have internal predecessors, (3035), 570 states have call successors, (570), 177 states have call predecessors, (570), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-02-06 06:22:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4185 transitions. [2025-02-06 06:22:27,529 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4185 transitions. Word has length 39 [2025-02-06 06:22:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:27,529 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4185 transitions. [2025-02-06 06:22:27,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4185 transitions. [2025-02-06 06:22:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 06:22:27,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:27,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:27,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:22:27,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:27,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:27,531 INFO L85 PathProgramCache]: Analyzing trace with hash 943830393, now seen corresponding path program 1 times [2025-02-06 06:22:27,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:27,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286328798] [2025-02-06 06:22:27,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:27,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:28,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 06:22:28,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 06:22:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286328798] [2025-02-06 06:22:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286328798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112020014] [2025-02-06 06:22:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:29,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:29,058 INFO L87 Difference]: Start difference. First operand 3099 states and 4185 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:29,296 INFO L93 Difference]: Finished difference Result 3101 states and 4186 transitions. [2025-02-06 06:22:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:29,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-02-06 06:22:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:29,307 INFO L225 Difference]: With dead ends: 3101 [2025-02-06 06:22:29,307 INFO L226 Difference]: Without dead ends: 3098 [2025-02-06 06:22:29,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:29,308 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1042 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:29,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1037 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2025-02-06 06:22:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2025-02-06 06:22:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2352 states have (on average 1.2899659863945578) internal successors, (3034), 2386 states have internal predecessors, (3034), 569 states have call successors, (569), 177 states have call predecessors, (569), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-02-06 06:22:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4183 transitions. [2025-02-06 06:22:29,408 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4183 transitions. Word has length 40 [2025-02-06 06:22:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4183 transitions. [2025-02-06 06:22:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4183 transitions. [2025-02-06 06:22:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 06:22:29,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:29,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:29,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:22:29,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:29,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash -806766437, now seen corresponding path program 1 times [2025-02-06 06:22:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039763074] [2025-02-06 06:22:29,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:30,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 06:22:30,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 06:22:30,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039763074] [2025-02-06 06:22:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039763074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:30,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:30,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:30,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584284483] [2025-02-06 06:22:30,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:30,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:30,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:30,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:30,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:30,497 INFO L87 Difference]: Start difference. First operand 3098 states and 4183 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:30,698 INFO L93 Difference]: Finished difference Result 3100 states and 4184 transitions. [2025-02-06 06:22:30,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:30,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-02-06 06:22:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:30,711 INFO L225 Difference]: With dead ends: 3100 [2025-02-06 06:22:30,711 INFO L226 Difference]: Without dead ends: 3097 [2025-02-06 06:22:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:30,713 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 1039 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1035 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2025-02-06 06:22:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2025-02-06 06:22:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2352 states have (on average 1.2895408163265305) internal successors, (3033), 2385 states have internal predecessors, (3033), 568 states have call successors, (568), 177 states have call predecessors, (568), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-02-06 06:22:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4181 transitions. [2025-02-06 06:22:30,844 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4181 transitions. Word has length 41 [2025-02-06 06:22:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:30,845 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4181 transitions. [2025-02-06 06:22:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:30,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4181 transitions. [2025-02-06 06:22:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 06:22:30,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:30,846 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:30,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:22:30,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash 759305658, now seen corresponding path program 1 times [2025-02-06 06:22:30,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:30,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379213126] [2025-02-06 06:22:30,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 06:22:31,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 06:22:31,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:31,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379213126] [2025-02-06 06:22:31,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379213126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:31,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:31,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246819834] [2025-02-06 06:22:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:31,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:31,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:31,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:31,922 INFO L87 Difference]: Start difference. First operand 3097 states and 4181 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:32,164 INFO L93 Difference]: Finished difference Result 3099 states and 4182 transitions. [2025-02-06 06:22:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-02-06 06:22:32,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:32,179 INFO L225 Difference]: With dead ends: 3099 [2025-02-06 06:22:32,179 INFO L226 Difference]: Without dead ends: 3087 [2025-02-06 06:22:32,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:32,182 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 1036 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:32,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1034 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2025-02-06 06:22:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2025-02-06 06:22:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2343 states have (on average 1.2889457959880495) internal successors, (3020), 2375 states have internal predecessors, (3020), 567 states have call successors, (567), 177 states have call predecessors, (567), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-02-06 06:22:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4167 transitions. [2025-02-06 06:22:32,390 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4167 transitions. Word has length 42 [2025-02-06 06:22:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:32,391 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4167 transitions. [2025-02-06 06:22:32,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-06 06:22:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4167 transitions. [2025-02-06 06:22:32,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 06:22:32,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:32,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-02-06 06:22:32,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:22:32,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 472691395, now seen corresponding path program 1 times [2025-02-06 06:22:32,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:32,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454120003] [2025-02-06 06:22:32,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:32,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:33,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-06 06:22:33,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 06:22:33,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:33,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:33,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454120003] [2025-02-06 06:22:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454120003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:33,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:33,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:33,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831670500] [2025-02-06 06:22:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:33,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:33,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:33,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:33,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:33,684 INFO L87 Difference]: Start difference. First operand 3087 states and 4167 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 06:22:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:34,149 INFO L93 Difference]: Finished difference Result 6410 states and 8624 transitions. [2025-02-06 06:22:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:34,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-02-06 06:22:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:34,163 INFO L225 Difference]: With dead ends: 6410 [2025-02-06 06:22:34,163 INFO L226 Difference]: Without dead ends: 3329 [2025-02-06 06:22:34,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:34,172 INFO L435 NwaCegarLoop]: 1112 mSDtfsCounter, 289 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:34,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 2116 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:22:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2025-02-06 06:22:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2025-02-06 06:22:34,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2526 states have (on average 1.2830562153602534) internal successors, (3241), 2560 states have internal predecessors, (3241), 605 states have call successors, (605), 198 states have call predecessors, (605), 197 states have return successors, (618), 600 states have call predecessors, (618), 604 states have call successors, (618) [2025-02-06 06:22:34,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4464 transitions. [2025-02-06 06:22:34,315 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4464 transitions. Word has length 87 [2025-02-06 06:22:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:34,315 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 4464 transitions. [2025-02-06 06:22:34,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 06:22:34,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4464 transitions. [2025-02-06 06:22:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 06:22:34,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:34,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2025-02-06 06:22:34,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:22:34,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:34,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1751720953, now seen corresponding path program 1 times [2025-02-06 06:22:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343011258] [2025-02-06 06:22:34,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:35,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 06:22:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 06:22:35,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:35,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 06:22:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343011258] [2025-02-06 06:22:35,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343011258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:35,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:35,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:35,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737590246] [2025-02-06 06:22:35,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:35,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:35,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:35,435 INFO L87 Difference]: Start difference. First operand 3329 states and 4464 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 06:22:39,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:40,101 INFO L93 Difference]: Finished difference Result 7363 states and 9837 transitions. [2025-02-06 06:22:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-02-06 06:22:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:40,117 INFO L225 Difference]: With dead ends: 7363 [2025-02-06 06:22:40,117 INFO L226 Difference]: Without dead ends: 4283 [2025-02-06 06:22:40,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:40,125 INFO L435 NwaCegarLoop]: 1315 mSDtfsCounter, 308 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2320 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:40,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2320 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states. [2025-02-06 06:22:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 4275. [2025-02-06 06:22:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 3254 states have (on average 1.2725875845113706) internal successors, (4141), 3296 states have internal predecessors, (4141), 749 states have call successors, (749), 272 states have call predecessors, (749), 271 states have return successors, (762), 744 states have call predecessors, (762), 748 states have call successors, (762) [2025-02-06 06:22:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 5652 transitions. [2025-02-06 06:22:40,271 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 5652 transitions. Word has length 103 [2025-02-06 06:22:40,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:40,272 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 5652 transitions. [2025-02-06 06:22:40,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-06 06:22:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 5652 transitions. [2025-02-06 06:22:40,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 06:22:40,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:40,277 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-02-06 06:22:40,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:22:40,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:40,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1044591209, now seen corresponding path program 1 times [2025-02-06 06:22:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:40,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596256271] [2025-02-06 06:22:40,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:41,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 06:22:41,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 06:22:41,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:41,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 06:22:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596256271] [2025-02-06 06:22:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596256271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:41,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:41,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670434289] [2025-02-06 06:22:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:41,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:41,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:41,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:41,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:41,634 INFO L87 Difference]: Start difference. First operand 4275 states and 5652 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 06:22:45,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:46,347 INFO L93 Difference]: Finished difference Result 10363 states and 13639 transitions. [2025-02-06 06:22:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:46,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2025-02-06 06:22:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:46,388 INFO L225 Difference]: With dead ends: 10363 [2025-02-06 06:22:46,389 INFO L226 Difference]: Without dead ends: 6337 [2025-02-06 06:22:46,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:46,406 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 836 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:46,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 2174 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2025-02-06 06:22:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6329. [2025-02-06 06:22:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6329 states, 4862 states have (on average 1.274167009461127) internal successors, (6195), 4928 states have internal predecessors, (6195), 1029 states have call successors, (1029), 438 states have call predecessors, (1029), 437 states have return successors, (1042), 1020 states have call predecessors, (1042), 1028 states have call successors, (1042) [2025-02-06 06:22:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6329 states to 6329 states and 8266 transitions. [2025-02-06 06:22:46,656 INFO L78 Accepts]: Start accepts. Automaton has 6329 states and 8266 transitions. Word has length 115 [2025-02-06 06:22:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:46,657 INFO L471 AbstractCegarLoop]: Abstraction has 6329 states and 8266 transitions. [2025-02-06 06:22:46,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 06:22:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 6329 states and 8266 transitions. [2025-02-06 06:22:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 06:22:46,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:46,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-02-06 06:22:46,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:22:46,664 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:46,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 446677629, now seen corresponding path program 1 times [2025-02-06 06:22:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:46,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991412871] [2025-02-06 06:22:46,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:46,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:47,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 06:22:47,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 06:22:47,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:47,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-06 06:22:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:48,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991412871] [2025-02-06 06:22:48,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991412871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:22:48,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479127384] [2025-02-06 06:22:48,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:22:48,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:48,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:22:48,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:22:50,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 06:22:50,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 06:22:50,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:50,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:50,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:22:50,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:22:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 06:22:51,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:22:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479127384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:22:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-06 06:22:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163453688] [2025-02-06 06:22:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 06:22:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:51,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 06:22:51,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:22:51,537 INFO L87 Difference]: Start difference. First operand 6329 states and 8266 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:22:55,553 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-02-06 06:22:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:59,361 INFO L93 Difference]: Finished difference Result 18953 states and 24759 transitions. [2025-02-06 06:22:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 06:22:59,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 132 [2025-02-06 06:22:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:59,423 INFO L225 Difference]: With dead ends: 18953 [2025-02-06 06:22:59,423 INFO L226 Difference]: Without dead ends: 18945 [2025-02-06 06:22:59,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:22:59,429 INFO L435 NwaCegarLoop]: 1247 mSDtfsCounter, 2555 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 223 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:59,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 2992 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2025-02-06 06:22:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18945 states. [2025-02-06 06:23:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18945 to 18914. [2025-02-06 06:23:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18914 states, 14527 states have (on average 1.2749363254629311) internal successors, (18521), 14738 states have internal predecessors, (18521), 3079 states have call successors, (3079), 1308 states have call predecessors, (3079), 1307 states have return successors, (3120), 3041 states have call predecessors, (3120), 3078 states have call successors, (3120) [2025-02-06 06:23:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18914 states to 18914 states and 24720 transitions. [2025-02-06 06:23:00,153 INFO L78 Accepts]: Start accepts. Automaton has 18914 states and 24720 transitions. Word has length 132 [2025-02-06 06:23:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:00,154 INFO L471 AbstractCegarLoop]: Abstraction has 18914 states and 24720 transitions. [2025-02-06 06:23:00,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:23:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18914 states and 24720 transitions. [2025-02-06 06:23:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-06 06:23:00,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:00,172 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2025-02-06 06:23:00,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 06:23:00,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-06 06:23:00,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:00,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 29468928, now seen corresponding path program 1 times [2025-02-06 06:23:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:00,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696291763] [2025-02-06 06:23:00,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:00,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 06:23:01,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 06:23:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-02-06 06:23:02,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696291763] [2025-02-06 06:23:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696291763] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:23:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104864574] [2025-02-06 06:23:02,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:23:02,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:23:02,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:23:03,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 06:23:03,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 06:23:03,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:03,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:03,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:23:03,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:23:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 06:23:04,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:23:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104864574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:23:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 06:23:04,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748808968] [2025-02-06 06:23:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:04,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:04,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:04,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:04,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:04,387 INFO L87 Difference]: Start difference. First operand 18914 states and 24720 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 06:23:08,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:09,023 INFO L93 Difference]: Finished difference Result 27885 states and 36489 transitions. [2025-02-06 06:23:09,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 142 [2025-02-06 06:23:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:09,055 INFO L225 Difference]: With dead ends: 27885 [2025-02-06 06:23:09,055 INFO L226 Difference]: Without dead ends: 9681 [2025-02-06 06:23:09,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:09,088 INFO L435 NwaCegarLoop]: 1215 mSDtfsCounter, 959 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:09,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1504 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-02-06 06:23:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9681 states. [2025-02-06 06:23:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9681 to 9681. [2025-02-06 06:23:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 7427 states have (on average 1.2723845428840717) internal successors, (9450), 7536 states have internal predecessors, (9450), 1579 states have call successors, (1579), 675 states have call predecessors, (1579), 674 states have return successors, (1599), 1559 states have call predecessors, (1599), 1578 states have call successors, (1599) [2025-02-06 06:23:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 12628 transitions. [2025-02-06 06:23:09,390 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 12628 transitions. Word has length 142 [2025-02-06 06:23:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:09,391 INFO L471 AbstractCegarLoop]: Abstraction has 9681 states and 12628 transitions. [2025-02-06 06:23:09,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-06 06:23:09,391 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 12628 transitions. [2025-02-06 06:23:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-06 06:23:09,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:09,403 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-06 06:23:09,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 06:23:09,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:09,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:09,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1635552728, now seen corresponding path program 1 times [2025-02-06 06:23:09,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580801334] [2025-02-06 06:23:09,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:09,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:10,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 06:23:10,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 06:23:10,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-06 06:23:11,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:11,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580801334] [2025-02-06 06:23:11,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580801334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:23:11,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993918619] [2025-02-06 06:23:11,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:23:11,045 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:23:11,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 06:23:12,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-06 06:23:13,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-06 06:23:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:13,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:13,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 06:23:13,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:23:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-06 06:23:13,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 06:23:13,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993918619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:13,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 06:23:13,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-06 06:23:13,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846069045] [2025-02-06 06:23:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:13,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:23:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:13,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:23:13,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:13,197 INFO L87 Difference]: Start difference. First operand 9681 states and 12628 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 06:23:17,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:23:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:18,026 INFO L93 Difference]: Finished difference Result 18627 states and 24347 transitions. [2025-02-06 06:23:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:23:18,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 144 [2025-02-06 06:23:18,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:18,099 INFO L225 Difference]: With dead ends: 18627 [2025-02-06 06:23:18,099 INFO L226 Difference]: Without dead ends: 9689 [2025-02-06 06:23:18,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 06:23:18,138 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 833 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:18,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2399 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:23:18,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9689 states. [2025-02-06 06:23:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9689 to 9681. [2025-02-06 06:23:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 7427 states have (on average 1.269960953278578) internal successors, (9432), 7536 states have internal predecessors, (9432), 1579 states have call successors, (1579), 675 states have call predecessors, (1579), 674 states have return successors, (1599), 1559 states have call predecessors, (1599), 1578 states have call successors, (1599) [2025-02-06 06:23:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 12610 transitions. [2025-02-06 06:23:18,450 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 12610 transitions. Word has length 144 [2025-02-06 06:23:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:18,450 INFO L471 AbstractCegarLoop]: Abstraction has 9681 states and 12610 transitions. [2025-02-06 06:23:18,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-02-06 06:23:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 12610 transitions. [2025-02-06 06:23:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 06:23:18,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:18,459 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:18,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 06:23:18,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:23:18,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:18,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:18,661 INFO L85 PathProgramCache]: Analyzing trace with hash -776138120, now seen corresponding path program 1 times [2025-02-06 06:23:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505171537] [2025-02-06 06:23:18,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:18,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:19,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 06:23:19,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 06:23:19,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:19,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-06 06:23:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:20,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505171537] [2025-02-06 06:23:20,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505171537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:20,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:20,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 06:23:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692986225] [2025-02-06 06:23:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:20,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 06:23:20,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:20,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 06:23:20,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:23:20,181 INFO L87 Difference]: Start difference. First operand 9681 states and 12610 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:23:20,968 INFO L93 Difference]: Finished difference Result 18757 states and 24580 transitions. [2025-02-06 06:23:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 06:23:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 147 [2025-02-06 06:23:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:23:21,000 INFO L225 Difference]: With dead ends: 18757 [2025-02-06 06:23:21,000 INFO L226 Difference]: Without dead ends: 9819 [2025-02-06 06:23:21,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 06:23:21,016 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 3 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4104 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:23:21,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4104 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 06:23:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9819 states. [2025-02-06 06:23:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9819 to 9783. [2025-02-06 06:23:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9783 states, 7499 states have (on average 1.2689691958927858) internal successors, (9516), 7614 states have internal predecessors, (9516), 1591 states have call successors, (1591), 675 states have call predecessors, (1591), 692 states have return successors, (1701), 1583 states have call predecessors, (1701), 1590 states have call successors, (1701) [2025-02-06 06:23:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 12808 transitions. [2025-02-06 06:23:21,325 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 12808 transitions. Word has length 147 [2025-02-06 06:23:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:23:21,326 INFO L471 AbstractCegarLoop]: Abstraction has 9783 states and 12808 transitions. [2025-02-06 06:23:21,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-06 06:23:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 12808 transitions. [2025-02-06 06:23:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 06:23:21,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:23:21,337 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:23:21,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 06:23:21,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:23:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:23:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -988404046, now seen corresponding path program 1 times [2025-02-06 06:23:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:23:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812495835] [2025-02-06 06:23:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:23:21,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:23:22,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 06:23:22,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 06:23:22,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:23:22,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:23:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-06 06:23:24,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:23:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812495835] [2025-02-06 06:23:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812495835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:23:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:23:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 06:23:24,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357417561] [2025-02-06 06:23:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:23:24,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 06:23:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:23:24,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 06:23:24,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-06 06:23:24,520 INFO L87 Difference]: Start difference. First operand 9783 states and 12808 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-06 06:23:28,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []