./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-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/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 08:17:58,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 08:17:59,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 08:17:59,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 08:17:59,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 08:17:59,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 08:17:59,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 08:17:59,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 08:17:59,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 08:17:59,058 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 08:17:59,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 08:17:59,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 08:17:59,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 08:17:59,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 08:17:59,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:17:59,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 08:17:59,063 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2025-03-17 08:17:59,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 08:17:59,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 08:17:59,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 08:17:59,372 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 08:17:59,376 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 08:17:59,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/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-03-17 08:18:00,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b1cb75/798edc3900264e5cadc256ab778cab6b/FLAG981e7aa90 [2025-03-17 08:18:01,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 08:18:01,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/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-03-17 08:18:01,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b1cb75/798edc3900264e5cadc256ab778cab6b/FLAG981e7aa90 [2025-03-17 08:18:01,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3b1cb75/798edc3900264e5cadc256ab778cab6b [2025-03-17 08:18:01,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 08:18:01,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 08:18:01,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 08:18:01,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 08:18:01,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 08:18:01,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:18:01" (1/1) ... [2025-03-17 08:18:01,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc5a4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:01, skipping insertion in model container [2025-03-17 08:18:01,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:18:01" (1/1) ... [2025-03-17 08:18:01,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 08:18:01,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-17 08:18:02,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:18:02,442 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 08:18:02,573 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2025-03-17 08:18:02,577 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-03-17 08:18:02,578 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-03-17 08:18:02,580 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-03-17 08:18:02,581 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-03-17 08:18:02,581 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-03-17 08:18:02,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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-03-17 08:18:02,629 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-03-17 08:18:02,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 08:18:02,725 INFO L204 MainTranslator]: Completed translation [2025-03-17 08:18:02,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02 WrapperNode [2025-03-17 08:18:02,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 08:18:02,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 08:18:02,728 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 08:18:02,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 08:18:02,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:02,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:02,896 INFO L138 Inliner]: procedures = 174, calls = 830, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2590 [2025-03-17 08:18:02,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 08:18:02,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 08:18:02,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 08:18:02,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 08:18:02,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:02,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:02,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,151 INFO L175 MemorySlicer]: Split 464 memory accesses to 8 slices as follows [2, 5, 1, 341, 44, 9, 31, 31]. 73 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 0, 0, 26, 0, 0, 0, 0]. The 249 writes are split as follows [0, 1, 0, 186, 44, 0, 18, 0]. [2025-03-17 08:18:03,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 08:18:03,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 08:18:03,276 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 08:18:03,276 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 08:18:03,277 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (1/1) ... [2025-03-17 08:18:03,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 08:18:03,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:18:03,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 08:18:03,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 08:18:03,354 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-17 08:18:03,354 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-17 08:18:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-03-17 08:18:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2025-03-17 08:18:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-03-17 08:18:03,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 08:18:03,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-17 08:18:03,356 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-17 08:18:03,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 08:18:03,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-17 08:18:03,361 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-03-17 08:18:03,361 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-03-17 08:18:03,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:18:03,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-17 08:18:03,362 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 08:18:03,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 08:18:03,363 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 08:18:03,363 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-17 08:18:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-03-17 08:18:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-17 08:18:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-17 08:18:03,364 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 08:18:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-17 08:18:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 08:18:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:18:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-03-17 08:18:03,366 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-03-17 08:18:03,366 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-17 08:18:03,367 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 08:18:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2025-03-17 08:18:03,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-17 08:18:03,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 08:18:03,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 08:18:03,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2025-03-17 08:18:03,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2025-03-17 08:18:03,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 08:18:03,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 08:18:03,917 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7476: havoc #t~nondet487; [2025-03-17 08:18:03,920 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-17 08:18:03,949 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5463: havoc constant_test_bit_#t~mem14#1;havoc constant_test_bit_#t~bitwise15#1; [2025-03-17 08:18:04,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5570: havoc #t~mem63;havoc #t~bitwise64; [2025-03-17 08:18:04,455 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc alloc_can_err_skb_#t~ret471#1.base, alloc_can_err_skb_#t~ret471#1.offset; [2025-03-17 08:18:04,455 INFO L1322 $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-03-17 08:18:04,455 INFO L1322 $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-03-17 08:18:04,455 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_can_skb_#t~ret472#1.base, alloc_can_skb_#t~ret472#1.offset; [2025-03-17 08:18:04,467 INFO L1322 $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-03-17 08:18:04,526 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7459: havoc printk_#t~nondet484#1; [2025-03-17 08:18:04,667 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet478; [2025-03-17 08:18:04,707 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-17 08:18:04,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7451: havoc netpoll_trap_#t~nondet482#1; [2025-03-17 08:18:04,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc can_get_echo_skb_#t~nondet474#1; [2025-03-17 08:18:04,905 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~ret486.base, #t~ret486.offset; [2025-03-17 08:18:04,911 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7447: havoc #t~nondet481; [2025-03-17 08:18:04,929 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc #t~nondet480; [2025-03-17 08:18:04,938 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc #t~mem79.base, #t~mem79.offset; [2025-03-17 08:18:04,941 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc #t~nondet479; [2025-03-17 08:18:05,008 INFO L1322 $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-03-17 08:18:05,008 INFO L1322 $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-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7402: havoc dev_err_#t~nondet475#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7376: havoc alloc_candev_#t~ret473#1.base, alloc_candev_#t~ret473#1.offset; [2025-03-17 08:18:11,580 INFO L1322 $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-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc ldv_ndo_init_2_#t~nondet476#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc atomic_read_#t~mem19#1; [2025-03-17 08:18:11,580 INFO L1322 $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-03-17 08:18:11,580 INFO L1322 $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-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: havoc ldv_ndo_uninit_2_#t~nondet477#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: havoc open_candev_#t~nondet483#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7489: havoc usb_register_driver_#t~nondet488#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc usb_string_#t~nondet489#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc register_candev_#t~nondet485#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc _dev_info_#t~nondet470#1; [2025-03-17 08:18:11,580 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5584: havoc __kmalloc_#t~ret67#1.base, __kmalloc_#t~ret67#1.offset; [2025-03-17 08:18:11,819 INFO L1322 $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-03-17 08:18:11,820 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc __fswab16_#t~bitwise9#1; [2025-03-17 08:18:12,043 INFO L? ?]: Removed 1018 outVars from TransFormulas that were not future-live. [2025-03-17 08:18:12,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 08:18:12,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 08:18:12,089 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 08:18:12,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:18:12 BoogieIcfgContainer [2025-03-17 08:18:12,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 08:18:12,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 08:18:12,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 08:18:12,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 08:18:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 08:18:01" (1/3) ... [2025-03-17 08:18:12,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc94bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:18:12, skipping insertion in model container [2025-03-17 08:18:12,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:18:02" (2/3) ... [2025-03-17 08:18:12,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc94bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 08:18:12, skipping insertion in model container [2025-03-17 08:18:12,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:18:12" (3/3) ... [2025-03-17 08:18:12,095 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-03-17 08:18:12,105 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 08:18:12,107 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, 825 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-17 08:18:12,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 08:18:12,176 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;@eb24edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 08:18:12,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 08:18:12,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 760 states, 558 states have (on average 1.3781362007168458) internal successors, (769), 578 states have internal predecessors, (769), 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-03-17 08:18:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 08:18:12,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:12,190 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] [2025-03-17 08:18:12,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:12,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 770616481, now seen corresponding path program 1 times [2025-03-17 08:18:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066083051] [2025-03-17 08:18:12,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 08:18:13,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 08:18:13,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:13,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 08:18:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:14,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066083051] [2025-03-17 08:18:14,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066083051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:14,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:14,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:14,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943897885] [2025-03-17 08:18:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:14,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:14,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:14,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:14,056 INFO L87 Difference]: Start difference. First operand has 760 states, 558 states have (on average 1.3781362007168458) internal successors, (769), 578 states have internal predecessors, (769), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-17 08:18:18,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:18:18,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:18,801 INFO L93 Difference]: Finished difference Result 2247 states and 3225 transitions. [2025-03-17 08:18:18,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:18,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 23 [2025-03-17 08:18:18,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:18,828 INFO L225 Difference]: With dead ends: 2247 [2025-03-17 08:18:18,828 INFO L226 Difference]: Without dead ends: 1468 [2025-03-17 08:18:18,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:18,841 INFO L435 NwaCegarLoop]: 1021 mSDtfsCounter, 1004 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:18,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 2020 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 08:18:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2025-03-17 08:18:18,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2025-03-17 08:18:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1090 states have (on average 1.3211009174311927) internal successors, (1440), 1110 states have internal predecessors, (1440), 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-03-17 08:18:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2013 transitions. [2025-03-17 08:18:19,020 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2013 transitions. Word has length 23 [2025-03-17 08:18:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:19,022 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2013 transitions. [2025-03-17 08:18:19,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-03-17 08:18:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2013 transitions. [2025-03-17 08:18:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 08:18:19,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:19,026 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] [2025-03-17 08:18:19,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 08:18:19,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:19,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2101951325, now seen corresponding path program 1 times [2025-03-17 08:18:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695883058] [2025-03-17 08:18:19,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:20,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 08:18:20,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 08:18:20,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:20,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:20,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:20,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695883058] [2025-03-17 08:18:20,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695883058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:20,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:20,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680372441] [2025-03-17 08:18:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:20,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:20,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:20,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:20,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:20,609 INFO L87 Difference]: Start difference. First operand 1468 states and 2013 transitions. 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, (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-03-17 08:18:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:21,274 INFO L93 Difference]: Finished difference Result 4393 states and 6048 transitions. [2025-03-17 08:18:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:21,275 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, (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 33 [2025-03-17 08:18:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:21,294 INFO L225 Difference]: With dead ends: 4393 [2025-03-17 08:18:21,294 INFO L226 Difference]: Without dead ends: 2930 [2025-03-17 08:18:21,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:21,301 INFO L435 NwaCegarLoop]: 1484 mSDtfsCounter, 1002 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 2460 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:21,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 2460 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 08:18:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2025-03-17 08:18:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2920. [2025-03-17 08:18:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2172 states have (on average 1.3195211786372008) internal successors, (2866), 2208 states have internal predecessors, (2866), 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-03-17 08:18:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4017 transitions. [2025-03-17 08:18:21,545 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4017 transitions. Word has length 33 [2025-03-17 08:18:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:21,548 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4017 transitions. [2025-03-17 08:18:21,548 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, (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-03-17 08:18:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4017 transitions. [2025-03-17 08:18:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 08:18:21,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:21,550 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] [2025-03-17 08:18:21,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 08:18:21,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:21,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 735301175, now seen corresponding path program 1 times [2025-03-17 08:18:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:21,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149008429] [2025-03-17 08:18:21,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 08:18:22,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 08:18:22,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:22,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:23,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:23,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:23,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149008429] [2025-03-17 08:18:23,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149008429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:23,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:23,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:23,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582557429] [2025-03-17 08:18:23,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:23,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:23,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:23,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:23,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:23,346 INFO L87 Difference]: Start difference. First operand 2920 states and 4017 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03-17 08:18:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:23,594 INFO L93 Difference]: Finished difference Result 2922 states and 4018 transitions. [2025-03-17 08:18:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 34 [2025-03-17 08:18:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:23,612 INFO L225 Difference]: With dead ends: 2922 [2025-03-17 08:18:23,612 INFO L226 Difference]: Without dead ends: 2919 [2025-03-17 08:18:23,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:23,619 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 1003 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 992 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:23,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 992 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:18:23,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2025-03-17 08:18:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2025-03-17 08:18:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2172 states have (on average 1.319060773480663) internal successors, (2865), 2207 states have internal predecessors, (2865), 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-03-17 08:18:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4015 transitions. [2025-03-17 08:18:23,732 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4015 transitions. Word has length 34 [2025-03-17 08:18:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:23,733 INFO L471 AbstractCegarLoop]: Abstraction has 2919 states and 4015 transitions. [2025-03-17 08:18:23,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-03-17 08:18:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4015 transitions. [2025-03-17 08:18:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 08:18:23,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:23,736 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] [2025-03-17 08:18:23,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 08:18:23,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1318818462, now seen corresponding path program 1 times [2025-03-17 08:18:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79483717] [2025-03-17 08:18:23,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:23,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:24,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 08:18:24,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 08:18:24,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:24,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79483717] [2025-03-17 08:18:24,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79483717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:24,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:24,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:24,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960486480] [2025-03-17 08:18:24,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:24,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:24,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:24,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:24,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:24,783 INFO L87 Difference]: Start difference. First operand 2919 states and 4015 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 08:18:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:25,001 INFO L93 Difference]: Finished difference Result 2921 states and 4016 transitions. [2025-03-17 08:18:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:25,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 35 [2025-03-17 08:18:25,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:25,014 INFO L225 Difference]: With dead ends: 2921 [2025-03-17 08:18:25,014 INFO L226 Difference]: Without dead ends: 2918 [2025-03-17 08:18:25,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:25,017 INFO L435 NwaCegarLoop]: 990 mSDtfsCounter, 1000 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 990 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-03-17 08:18:25,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 990 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 08:18:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2025-03-17 08:18:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2918. [2025-03-17 08:18:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2172 states have (on average 1.3186003683241252) internal successors, (2864), 2206 states have internal predecessors, (2864), 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-03-17 08:18:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 4013 transitions. [2025-03-17 08:18:25,114 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 4013 transitions. Word has length 35 [2025-03-17 08:18:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:25,114 INFO L471 AbstractCegarLoop]: Abstraction has 2918 states and 4013 transitions. [2025-03-17 08:18:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-03-17 08:18:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 4013 transitions. [2025-03-17 08:18:25,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 08:18:25,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:25,117 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] [2025-03-17 08:18:25,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 08:18:25,117 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:25,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2066983144, now seen corresponding path program 1 times [2025-03-17 08:18:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177977107] [2025-03-17 08:18:25,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:26,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 08:18:26,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 08:18:26,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177977107] [2025-03-17 08:18:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177977107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36421811] [2025-03-17 08:18:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:26,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:26,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:26,263 INFO L87 Difference]: Start difference. First operand 2918 states and 4013 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-03-17 08:18:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:26,513 INFO L93 Difference]: Finished difference Result 2920 states and 4014 transitions. [2025-03-17 08:18:26,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:26,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 36 [2025-03-17 08:18:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:26,528 INFO L225 Difference]: With dead ends: 2920 [2025-03-17 08:18:26,529 INFO L226 Difference]: Without dead ends: 2917 [2025-03-17 08:18:26,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:26,531 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 997 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 988 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:26,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 988 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:18:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2025-03-17 08:18:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2917. [2025-03-17 08:18:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2917 states, 2172 states have (on average 1.3181399631675874) internal successors, (2863), 2205 states have internal predecessors, (2863), 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-03-17 08:18:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4011 transitions. [2025-03-17 08:18:26,637 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4011 transitions. Word has length 36 [2025-03-17 08:18:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:26,637 INFO L471 AbstractCegarLoop]: Abstraction has 2917 states and 4011 transitions. [2025-03-17 08:18:26,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-03-17 08:18:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4011 transitions. [2025-03-17 08:18:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-17 08:18:26,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:26,640 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] [2025-03-17 08:18:26,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 08:18:26,640 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:26,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:26,640 INFO L85 PathProgramCache]: Analyzing trace with hash 347348447, now seen corresponding path program 1 times [2025-03-17 08:18:26,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:26,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458815934] [2025-03-17 08:18:26,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:26,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:27,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 08:18:27,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 08:18:27,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:27,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:27,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:27,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458815934] [2025-03-17 08:18:27,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458815934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:27,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:27,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:27,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582993240] [2025-03-17 08:18:27,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:27,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:27,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:27,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:27,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:27,767 INFO L87 Difference]: Start difference. First operand 2917 states and 4011 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-17 08:18:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:28,011 INFO L93 Difference]: Finished difference Result 2919 states and 4012 transitions. [2025-03-17 08:18:28,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 37 [2025-03-17 08:18:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:28,027 INFO L225 Difference]: With dead ends: 2919 [2025-03-17 08:18:28,027 INFO L226 Difference]: Without dead ends: 2910 [2025-03-17 08:18:28,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:28,031 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 994 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 987 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-03-17 08:18:28,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 987 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 08:18:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2910 states. [2025-03-17 08:18:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2910 to 2910. [2025-03-17 08:18:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2910 states, 2166 states have (on average 1.317174515235457) internal successors, (2853), 2198 states have internal predecessors, (2853), 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-03-17 08:18:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4000 transitions. [2025-03-17 08:18:28,143 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4000 transitions. Word has length 37 [2025-03-17 08:18:28,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 2910 states and 4000 transitions. [2025-03-17 08:18:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03-17 08:18:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4000 transitions. [2025-03-17 08:18:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 08:18:28,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:28,152 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] [2025-03-17 08:18:28,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 08:18:28,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:28,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash 518427122, now seen corresponding path program 1 times [2025-03-17 08:18:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154573366] [2025-03-17 08:18:28,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:29,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 08:18:29,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 08:18:29,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:29,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 08:18:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154573366] [2025-03-17 08:18:29,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154573366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:29,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123067753] [2025-03-17 08:18:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:29,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:29,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:29,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:29,199 INFO L87 Difference]: Start difference. First operand 2910 states and 4000 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-17 08:18:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:29,819 INFO L93 Difference]: Finished difference Result 6636 states and 9046 transitions. [2025-03-17 08:18:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:29,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 79 [2025-03-17 08:18:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:29,838 INFO L225 Difference]: With dead ends: 6636 [2025-03-17 08:18:29,838 INFO L226 Difference]: Without dead ends: 3731 [2025-03-17 08:18:29,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:29,847 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 273 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:29,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 2026 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 08:18:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2025-03-17 08:18:30,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 3726. [2025-03-17 08:18:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 2762 states have (on average 1.3062997827661116) internal successors, (3608), 2802 states have internal predecessors, (3608), 712 states have call successors, (712), 252 states have call predecessors, (712), 251 states have return successors, (725), 707 states have call predecessors, (725), 711 states have call successors, (725) [2025-03-17 08:18:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 5045 transitions. [2025-03-17 08:18:30,085 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 5045 transitions. Word has length 79 [2025-03-17 08:18:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:30,085 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 5045 transitions. [2025-03-17 08:18:30,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-17 08:18:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 5045 transitions. [2025-03-17 08:18:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-17 08:18:30,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:30,092 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] [2025-03-17 08:18:30,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 08:18:30,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:30,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1290559811, now seen corresponding path program 1 times [2025-03-17 08:18:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061869395] [2025-03-17 08:18:30,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:31,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-17 08:18:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-17 08:18:31,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:31,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 08:18:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061869395] [2025-03-17 08:18:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061869395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:31,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874102655] [2025-03-17 08:18:31,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:31,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:31,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:31,274 INFO L87 Difference]: Start difference. First operand 3726 states and 5045 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-17 08:18:35,293 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-03-17 08:18:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:36,144 INFO L93 Difference]: Finished difference Result 8304 states and 11210 transitions. [2025-03-17 08:18:36,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:36,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 91 [2025-03-17 08:18:36,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:36,178 INFO L225 Difference]: With dead ends: 8304 [2025-03-17 08:18:36,178 INFO L226 Difference]: Without dead ends: 4589 [2025-03-17 08:18:36,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:36,194 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 283 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:36,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2201 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 08:18:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-03-17 08:18:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4584. [2025-03-17 08:18:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4584 states, 3402 states have (on average 1.3009994121105233) internal successors, (4426), 3450 states have internal predecessors, (4426), 856 states have call successors, (856), 326 states have call predecessors, (856), 325 states have return successors, (869), 851 states have call predecessors, (869), 855 states have call successors, (869) [2025-03-17 08:18:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4584 states to 4584 states and 6151 transitions. [2025-03-17 08:18:36,475 INFO L78 Accepts]: Start accepts. Automaton has 4584 states and 6151 transitions. Word has length 91 [2025-03-17 08:18:36,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:36,475 INFO L471 AbstractCegarLoop]: Abstraction has 4584 states and 6151 transitions. [2025-03-17 08:18:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-03-17 08:18:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4584 states and 6151 transitions. [2025-03-17 08:18:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 08:18:36,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:36,482 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] [2025-03-17 08:18:36,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 08:18:36,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:36,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:36,483 INFO L85 PathProgramCache]: Analyzing trace with hash -92589989, now seen corresponding path program 1 times [2025-03-17 08:18:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764477231] [2025-03-17 08:18:36,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:37,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 08:18:37,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 08:18:37,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:37,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 08:18:38,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:38,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764477231] [2025-03-17 08:18:38,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764477231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:18:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 08:18:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950399103] [2025-03-17 08:18:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:38,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:18:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:38,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:18:38,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:38,154 INFO L87 Difference]: Start difference. First operand 4584 states and 6151 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-03-17 08:18:42,172 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-03-17 08:18:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:42,925 INFO L93 Difference]: Finished difference Result 11096 states and 14816 transitions. [2025-03-17 08:18:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:18:42,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2025-03-17 08:18:42,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:42,979 INFO L225 Difference]: With dead ends: 11096 [2025-03-17 08:18:42,980 INFO L226 Difference]: Without dead ends: 6523 [2025-03-17 08:18:43,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 08:18:43,001 INFO L435 NwaCegarLoop]: 1258 mSDtfsCounter, 801 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2057 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:43,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2057 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 08:18:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2025-03-17 08:18:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6518. [2025-03-17 08:18:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6518 states, 4890 states have (on average 1.301840490797546) internal successors, (6366), 4962 states have internal predecessors, (6366), 1136 states have call successors, (1136), 492 states have call predecessors, (1136), 491 states have return successors, (1149), 1127 states have call predecessors, (1149), 1135 states have call successors, (1149) [2025-03-17 08:18:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6518 states to 6518 states and 8651 transitions. [2025-03-17 08:18:43,277 INFO L78 Accepts]: Start accepts. Automaton has 6518 states and 8651 transitions. Word has length 103 [2025-03-17 08:18:43,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:43,277 INFO L471 AbstractCegarLoop]: Abstraction has 6518 states and 8651 transitions. [2025-03-17 08:18:43,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-03-17 08:18:43,278 INFO L276 IsEmpty]: Start isEmpty. Operand 6518 states and 8651 transitions. [2025-03-17 08:18:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 08:18:43,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:43,286 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] [2025-03-17 08:18:43,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 08:18:43,286 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:43,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -792515889, now seen corresponding path program 1 times [2025-03-17 08:18:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859633737] [2025-03-17 08:18:43,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:44,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 08:18:44,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 08:18:44,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-17 08:18:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859633737] [2025-03-17 08:18:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859633737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:18:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124510884] [2025-03-17 08:18:44,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:44,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:18:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:18:44,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:18:44,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 08:18:46,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 08:18:46,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 08:18:46,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:46,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:46,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1913 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 08:18:46,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:18:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 08:18:47,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:18:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124510884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:18:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:18:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-17 08:18:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682657266] [2025-03-17 08:18:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:18:47,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:18:47,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:18:47,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:18:47,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:18:47,318 INFO L87 Difference]: Start difference. First operand 6518 states and 8651 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-17 08:18:51,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 08:18:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:18:55,277 INFO L93 Difference]: Finished difference Result 19537 states and 25929 transitions. [2025-03-17 08:18:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 08:18:55,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 120 [2025-03-17 08:18:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:18:55,365 INFO L225 Difference]: With dead ends: 19537 [2025-03-17 08:18:55,365 INFO L226 Difference]: Without dead ends: 19532 [2025-03-17 08:18:55,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 08:18:55,377 INFO L435 NwaCegarLoop]: 1182 mSDtfsCounter, 2452 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 223 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2452 SdHoareTripleChecker+Valid, 2838 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 08:18:55,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2452 Valid, 2838 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-03-17 08:18:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19532 states. [2025-03-17 08:18:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19532 to 19498. [2025-03-17 08:18:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19498 states, 14626 states have (on average 1.3023383016545877) internal successors, (19048), 14858 states have internal predecessors, (19048), 3400 states have call successors, (3400), 1472 states have call predecessors, (3400), 1471 states have return successors, (3441), 3359 states have call predecessors, (3441), 3399 states have call successors, (3441) [2025-03-17 08:18:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19498 states to 19498 states and 25889 transitions. [2025-03-17 08:18:56,104 INFO L78 Accepts]: Start accepts. Automaton has 19498 states and 25889 transitions. Word has length 120 [2025-03-17 08:18:56,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:18:56,105 INFO L471 AbstractCegarLoop]: Abstraction has 19498 states and 25889 transitions. [2025-03-17 08:18:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-03-17 08:18:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19498 states and 25889 transitions. [2025-03-17 08:18:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 08:18:56,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:18:56,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 08:18:56,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 08:18:56,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 08:18:56,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:18:56,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:18:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -131049461, now seen corresponding path program 1 times [2025-03-17 08:18:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:18:56,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770396186] [2025-03-17 08:18:56,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:18:57,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 08:18:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 08:18:57,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:57,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-17 08:18:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:18:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770396186] [2025-03-17 08:18:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770396186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:18:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649265664] [2025-03-17 08:18:57,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:18:57,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:18:57,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:18:57,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:18:58,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 08:18:59,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 08:18:59,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 08:18:59,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:18:59,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:18:59,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 08:18:59,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:19:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-17 08:19:00,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:19:00,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649265664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:19:00,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:19:00,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 08:19:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029819207] [2025-03-17 08:19:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:19:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:19:00,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:19:00,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:19:00,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:19:00,500 INFO L87 Difference]: Start difference. First operand 19498 states and 25889 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-03-17 08:19:04,526 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-03-17 08:19:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:19:05,311 INFO L93 Difference]: Finished difference Result 29739 states and 39478 transitions. [2025-03-17 08:19:05,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:19:05,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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 130 [2025-03-17 08:19:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:19:05,400 INFO L225 Difference]: With dead ends: 29739 [2025-03-17 08:19:05,400 INFO L226 Difference]: Without dead ends: 9662 [2025-03-17 08:19:05,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:19:05,459 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 920 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 08:19:05,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1419 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 08:19:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2025-03-17 08:19:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9662. [2025-03-17 08:19:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9662 states, 7249 states have (on average 1.298385984273693) internal successors, (9412), 7365 states have internal predecessors, (9412), 1684 states have call successors, (1684), 729 states have call predecessors, (1684), 728 states have return successors, (1704), 1663 states have call predecessors, (1704), 1683 states have call successors, (1704) [2025-03-17 08:19:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9662 states to 9662 states and 12800 transitions. [2025-03-17 08:19:06,100 INFO L78 Accepts]: Start accepts. Automaton has 9662 states and 12800 transitions. Word has length 130 [2025-03-17 08:19:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:19:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 9662 states and 12800 transitions. [2025-03-17 08:19:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-03-17 08:19:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 9662 states and 12800 transitions. [2025-03-17 08:19:06,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 08:19:06,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:19:06,121 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] [2025-03-17 08:19:06,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 08:19:06,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 08:19:06,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:19:06,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:19:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -146390854, now seen corresponding path program 1 times [2025-03-17 08:19:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:19:06,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439958489] [2025-03-17 08:19:06,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:19:06,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:19:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 08:19:07,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 08:19:07,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:19:07,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:19:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-17 08:19:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:19:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439958489] [2025-03-17 08:19:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439958489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 08:19:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101645825] [2025-03-17 08:19:08,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:19:08,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:19:08,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 08:19:08,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 08:19:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 08:19:09,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 08:19:10,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 08:19:10,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:19:10,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:19:10,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1948 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 08:19:10,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 08:19:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-17 08:19:10,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 08:19:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101645825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:19:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 08:19:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-17 08:19:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987796523] [2025-03-17 08:19:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:19:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 08:19:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:19:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 08:19:10,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:19:10,252 INFO L87 Difference]: Start difference. First operand 9662 states and 12800 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, (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-03-17 08:19:14,270 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-03-17 08:19:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 08:19:15,147 INFO L93 Difference]: Finished difference Result 18074 states and 24006 transitions. [2025-03-17 08:19:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 08:19:15,147 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, (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 132 [2025-03-17 08:19:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 08:19:15,189 INFO L225 Difference]: With dead ends: 18074 [2025-03-17 08:19:15,189 INFO L226 Difference]: Without dead ends: 9077 [2025-03-17 08:19:15,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 08:19:15,211 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 793 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-17 08:19:15,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2285 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-17 08:19:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9077 states. [2025-03-17 08:19:15,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9077 to 9072. [2025-03-17 08:19:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9072 states, 6818 states have (on average 1.2975946025227338) internal successors, (8847), 6927 states have internal predecessors, (8847), 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-03-17 08:19:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 12025 transitions. [2025-03-17 08:19:15,757 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 12025 transitions. Word has length 132 [2025-03-17 08:19:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 08:19:15,762 INFO L471 AbstractCegarLoop]: Abstraction has 9072 states and 12025 transitions. [2025-03-17 08:19:15,762 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, (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-03-17 08:19:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 12025 transitions. [2025-03-17 08:19:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 08:19:15,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 08:19:15,789 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-17 08:19:15,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 08:19:15,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 08:19:15,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 08:19:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 08:19:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -311218770, now seen corresponding path program 1 times [2025-03-17 08:19:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 08:19:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78104823] [2025-03-17 08:19:15,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 08:19:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 08:19:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 08:19:17,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 08:19:17,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 08:19:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 08:19:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 08:19:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 08:19:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78104823] [2025-03-17 08:19:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78104823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 08:19:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 08:19:17,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 08:19:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850633844] [2025-03-17 08:19:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 08:19:17,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 08:19:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 08:19:17,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 08:19:17,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 08:19:17,615 INFO L87 Difference]: Start difference. First operand 9072 states and 12025 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13)