./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.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 4de76b02991c4f8780142b48e1370b1ba073d7148b74e77b2c83d6f21359d59e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:33:22,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:33:22,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:33:22,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:33:22,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:33:22,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:33:22,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:33:22,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:33:22,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:33:22,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:33:22,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:33:22,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:33:22,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:33:22,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:33:22,504 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:33:22,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:33:22,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:33:22,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:33:22,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:33:22,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:33:22,506 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 -> 4de76b02991c4f8780142b48e1370b1ba073d7148b74e77b2c83d6f21359d59e [2025-03-04 04:33:22,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:33:22,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:33:22,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:33:22,764 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:33:22,765 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:33:22,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-03-04 04:33:23,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef96a662/03a9c74f1b4945f28a0e70f16ea493ac/FLAGc712cc19a [2025-03-04 04:33:24,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:33:24,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-03-04 04:33:24,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef96a662/03a9c74f1b4945f28a0e70f16ea493ac/FLAGc712cc19a [2025-03-04 04:33:24,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ef96a662/03a9c74f1b4945f28a0e70f16ea493ac [2025-03-04 04:33:24,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:33:24,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:33:24,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:33:24,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:33:24,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:33:24,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:33:24" (1/1) ... [2025-03-04 04:33:24,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32776d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:24, skipping insertion in model container [2025-03-04 04:33:24,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:33:24" (1/1) ... [2025-03-04 04:33:24,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:33:25,402 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i[185536,185549] [2025-03-04 04:33:25,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:33:25,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:33:25,628 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"); [3542] [2025-03-04 04:33:25,630 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)); [3549] [2025-03-04 04:33:25,631 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %2, %0; setc %1": "+m" (*addr), "=qm" (c): "Ir" (nr): "memory"); [3557-3558] [2025-03-04 04:33:25,729 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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i[185536,185549] [2025-03-04 04:33:25,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:33:25,791 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:33:25,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25 WrapperNode [2025-03-04 04:33:25,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:33:25,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:33:25,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:33:25,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:33:25,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:25,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:25,947 INFO L138 Inliner]: procedures = 282, calls = 1556, calls flagged for inlining = 103, calls inlined = 86, statements flattened = 2839 [2025-03-04 04:33:25,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:33:25,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:33:25,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:33:25,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:33:25,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:25,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:25,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,213 INFO L175 MemorySlicer]: Split 590 memory accesses to 22 slices as follows [2, 8, 49, 2, 8, 8, 7, 8, 8, 8, 12, 8, 8, 4, 56, 29, 8, 22, 45, 10, 4, 276]. 47 percent of accesses are in the largest equivalence class. The 180 initializations are split as follows [2, 8, 0, 0, 8, 8, 0, 8, 8, 8, 0, 8, 8, 4, 56, 0, 8, 0, 0, 10, 0, 36]. The 236 writes are split as follows [0, 0, 42, 1, 0, 0, 6, 0, 0, 0, 2, 0, 0, 0, 0, 29, 0, 22, 45, 0, 1, 88]. [2025-03-04 04:33:26,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:33:26,326 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:33:26,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:33:26,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:33:26,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (1/1) ... [2025-03-04 04:33:26,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:33:26,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:33:26,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 04:33:26,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 04:33:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-04 04:33:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2025-03-04 04:33:26,392 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:33:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:33:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#15 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#16 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#17 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#18 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#19 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#20 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#21 [2025-03-04 04:33:26,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wdm_mutex [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wdm_mutex [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2025-03-04 04:33:26,395 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 04:33:26,395 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_poll [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_poll [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_39 [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_39 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_write [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_write [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2025-03-04 04:33:26,396 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:33:26,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_rlock_of_wdm_device [2025-03-04 04:33:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_rlock_of_wdm_device [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 04:33:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 04:33:26,397 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 04:33:26,397 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 04:33:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_rxwork [2025-03-04 04:33:26,400 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_rxwork [2025-03-04 04:33:26,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:33:26,400 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_1 [2025-03-04 04:33:26,400 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_1 [2025-03-04 04:33:26,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:33:26,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wdm_mutex [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wdm_mutex [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wlock_of_wdm_device [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wlock_of_wdm_device [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_flush [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_flush [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wlock_of_wdm_device [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wlock_of_wdm_device [2025-03-04 04:33:26,402 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-04 04:33:26,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2025-03-04 04:33:26,403 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:33:26,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:33:26,406 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:33:26,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 04:33:26,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:33:26,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:33:26,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-03-04 04:33:26,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_rlock_of_wdm_device [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_rlock_of_wdm_device [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2025-03-04 04:33:26,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:33:26,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:33:26,902 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:33:26,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:33:26,935 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7561: havoc #t~nondet628; [2025-03-04 04:33:26,958 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:33:27,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7534: havoc #t~nondet625; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5132: 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;call ULTIMATE.dealloc(~#__key___1~0#1.base, ~#__key___1~0#1.offset);havoc ~#__key___1~0#1.base, ~#__key___1~0#1.offset;call ULTIMATE.dealloc(~#__key___2~0#1.base, ~#__key___2~0#1.offset);havoc ~#__key___2~0#1.base, ~#__key___2~0#1.offset;call ULTIMATE.dealloc(~#__key___3~0#1.base, ~#__key___3~0#1.offset);havoc ~#__key___3~0#1.base, ~#__key___3~0#1.offset;call ULTIMATE.dealloc(~#__constr_expr_0~0#1.base, ~#__constr_expr_0~0#1.offset);havoc ~#__constr_expr_0~0#1.base, ~#__constr_expr_0~0#1.offset; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7553: havoc usb_register_dev_#t~nondet626#1; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3954: havoc usb_endpoint_xfer_int_#t~mem112#1; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3988: havoc dev_name_#t~mem117#1.base, dev_name_#t~mem117#1.offset; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3980: havoc usb_endpoint_maxp_#t~mem115#1; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3948: havoc usb_endpoint_dir_in_#t~mem111#1; [2025-03-04 04:33:27,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3882: havoc kobject_name_#t~mem87#1.base, kobject_name_#t~mem87#1.offset; [2025-03-04 04:33:27,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: call ULTIMATE.dealloc(~#__wait~0#1.base, ~#__wait~0#1.offset);havoc ~#__wait~0#1.base, ~#__wait~0#1.offset;call ULTIMATE.dealloc(~#descriptor~2#1.base, ~#descriptor~2#1.offset);havoc ~#descriptor~2#1.base, ~#descriptor~2#1.offset; [2025-03-04 04:33:27,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7446: havoc _copy_from_user_#t~nondet614#1; [2025-03-04 04:33:27,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6186-1: ldv_mutex_lock_interruptible_17_#res#1 := ldv_mutex_lock_interruptible_17_~ldv_func_res~5#1; [2025-03-04 04:33:27,773 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5385: call ULTIMATE.dealloc(~#descriptor~6#1.base, ~#descriptor~6#1.offset);havoc ~#descriptor~6#1.base, ~#descriptor~6#1.offset; [2025-03-04 04:33:27,790 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7501: havoc #t~nondet618; [2025-03-04 04:33:27,828 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7476: havoc #t~nondet617; [2025-03-04 04:33:27,835 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7524: havoc #t~nondet623; [2025-03-04 04:33:27,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3833: havoc __kmalloc_#t~ret83#1.base, __kmalloc_#t~ret83#1.offset; [2025-03-04 04:33:27,841 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc #t~nondet616; [2025-03-04 04:33:27,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7530: havoc #t~ret624.base, #t~ret624.offset; [2025-03-04 04:33:27,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4853: call ULTIMATE.dealloc(~#__wait~2.base, ~#__wait~2.offset);havoc ~#__wait~2.base, ~#__wait~2.offset; [2025-03-04 04:33:27,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4083: havoc #t~mem144;havoc #t~bitwise145; [2025-03-04 04:33:27,905 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3565: havoc #t~mem1;havoc #t~bitwise2; [2025-03-04 04:33:27,913 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7516: havoc #t~nondet621; [2025-03-04 04:33:27,924 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7450: havoc _copy_to_user_#t~nondet615#1; [2025-03-04 04:33:27,961 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5511: call ULTIMATE.dealloc(~#descriptor~8.base, ~#descriptor~8.offset);havoc ~#descriptor~8.base, ~#descriptor~8.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5785: call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset);havoc main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset);havoc main_~#ldvarg14~0#1.base, main_~#ldvarg14~0#1.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5290: call ULTIMATE.dealloc(wdm_probe_~#descriptor~5#1.base, wdm_probe_~#descriptor~5#1.offset);havoc wdm_probe_~#descriptor~5#1.base, wdm_probe_~#descriptor~5#1.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6215-1: ldv_mutex_lock_interruptible_20_#res#1 := ldv_mutex_lock_interruptible_20_~ldv_func_res~6#1; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5427: call ULTIMATE.dealloc(wdm_suspend_~#message#1.base, wdm_suspend_~#message#1.offset);havoc wdm_suspend_~#message#1.base, wdm_suspend_~#message#1.offset;call ULTIMATE.dealloc(wdm_suspend_~#descriptor~7#1.base, wdm_suspend_~#descriptor~7#1.offset);havoc wdm_suspend_~#descriptor~7#1.base, wdm_suspend_~#descriptor~7#1.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7512: havoc noop_llseek_#t~nondet620#1; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5003: call ULTIMATE.dealloc(wdm_release_~#descriptor~4#1.base, wdm_release_~#descriptor~4#1.offset);havoc wdm_release_~#descriptor~4#1.base, wdm_release_~#descriptor~4#1.offset;call ULTIMATE.dealloc(wdm_release_~#descriptor___0~2#1.base, wdm_release_~#descriptor___0~2#1.offset);havoc wdm_release_~#descriptor___0~2#1.base, wdm_release_~#descriptor___0~2#1.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4677: call ULTIMATE.dealloc(wdm_read_~#__wait~1#1.base, wdm_read_~#__wait~1#1.offset);havoc wdm_read_~#__wait~1#1.base, wdm_read_~#__wait~1#1.offset;call ULTIMATE.dealloc(wdm_read_~#descriptor~3#1.base, wdm_read_~#descriptor~3#1.offset);havoc wdm_read_~#descriptor~3#1.base, wdm_read_~#descriptor~3#1.offset; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7557: havoc usb_register_driver_#t~nondet627#1; [2025-03-04 04:33:33,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3928: havoc iminor_#t~mem100#1; [2025-03-04 04:33:33,703 INFO L? ?]: Removed 1104 outVars from TransFormulas that were not future-live. [2025-03-04 04:33:33,703 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:33:33,748 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:33:33,748 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:33:33,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:33:33 BoogieIcfgContainer [2025-03-04 04:33:33,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:33:33,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:33:33,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:33:33,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:33:33,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:33:24" (1/3) ... [2025-03-04 04:33:33,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4e647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:33:33, skipping insertion in model container [2025-03-04 04:33:33,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:33:25" (2/3) ... [2025-03-04 04:33:33,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de4e647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:33:33, skipping insertion in model container [2025-03-04 04:33:33,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:33:33" (3/3) ... [2025-03-04 04:33:33,755 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2025-03-04 04:33:33,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:33:33,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i that has 74 procedures, 1135 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 04:33:33,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:33:33,860 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;@6f102621, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:33:33,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:33:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 744 states have (on average 1.3091397849462365) internal successors, (974), 781 states have internal predecessors, (974), 316 states have call successors, (316), 73 states have call predecessors, (316), 72 states have return successors, (311), 308 states have call predecessors, (311), 311 states have call successors, (311) [2025-03-04 04:33:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 04:33:33,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:33,884 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:33,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:33,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1657613029, now seen corresponding path program 1 times [2025-03-04 04:33:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058092856] [2025-03-04 04:33:33,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:33,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:34,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 04:33:35,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 04:33:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-04 04:33:35,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058092856] [2025-03-04 04:33:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058092856] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:33:35,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612922415] [2025-03-04 04:33:35,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:35,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:33:35,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:33:35,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:33:35,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:33:36,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 04:33:37,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 04:33:37,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:37,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:37,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 3146 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:33:37,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:33:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 04:33:37,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:33:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612922415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:33:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:33:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761789865] [2025-03-04 04:33:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:37,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:33:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:37,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:33:37,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:33:37,128 INFO L87 Difference]: Start difference. First operand has 1134 states, 744 states have (on average 1.3091397849462365) internal successors, (974), 781 states have internal predecessors, (974), 316 states have call successors, (316), 73 states have call predecessors, (316), 72 states have return successors, (311), 308 states have call predecessors, (311), 311 states have call successors, (311) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:33:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:37,292 INFO L93 Difference]: Finished difference Result 2263 states and 3249 transitions. [2025-03-04 04:33:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:33:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 192 [2025-03-04 04:33:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:37,311 INFO L225 Difference]: With dead ends: 2263 [2025-03-04 04:33:37,311 INFO L226 Difference]: Without dead ends: 1122 [2025-03-04 04:33:37,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:33:37,322 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:37,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1566 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:33:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2025-03-04 04:33:37,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2025-03-04 04:33:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 739 states have (on average 1.2936400541271988) internal successors, (956), 769 states have internal predecessors, (956), 311 states have call successors, (311), 72 states have call predecessors, (311), 71 states have return successors, (297), 294 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-04 04:33:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1564 transitions. [2025-03-04 04:33:37,423 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1564 transitions. Word has length 192 [2025-03-04 04:33:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1564 transitions. [2025-03-04 04:33:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 04:33:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1564 transitions. [2025-03-04 04:33:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 04:33:37,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:37,427 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:37,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:33:37,628 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,SelfDestructingSolverStorable0 [2025-03-04 04:33:37,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:37,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1942091358, now seen corresponding path program 1 times [2025-03-04 04:33:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:37,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862524586] [2025-03-04 04:33:37,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:38,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 04:33:38,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 04:33:38,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:38,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-03-04 04:33:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:39,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862524586] [2025-03-04 04:33:39,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862524586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:39,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:39,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615870937] [2025-03-04 04:33:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:39,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:39,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:39,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:39,061 INFO L87 Difference]: Start difference. First operand 1122 states and 1564 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 04:33:43,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:33:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:43,495 INFO L93 Difference]: Finished difference Result 3256 states and 4541 transitions. [2025-03-04 04:33:43,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:43,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 192 [2025-03-04 04:33:43,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:43,514 INFO L225 Difference]: With dead ends: 3256 [2025-03-04 04:33:43,514 INFO L226 Difference]: Without dead ends: 2175 [2025-03-04 04:33:43,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:43,520 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1469 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:43,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 3093 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:33:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2025-03-04 04:33:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2165. [2025-03-04 04:33:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 1434 states have (on average 1.295676429567643) internal successors, (1858), 1481 states have internal predecessors, (1858), 589 states have call successors, (589), 142 states have call predecessors, (589), 141 states have return successors, (575), 569 states have call predecessors, (575), 575 states have call successors, (575) [2025-03-04 04:33:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3022 transitions. [2025-03-04 04:33:43,609 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3022 transitions. Word has length 192 [2025-03-04 04:33:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:43,610 INFO L471 AbstractCegarLoop]: Abstraction has 2165 states and 3022 transitions. [2025-03-04 04:33:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-04 04:33:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3022 transitions. [2025-03-04 04:33:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-04 04:33:43,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:43,615 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:43,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:33:43,616 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:43,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash -83755200, now seen corresponding path program 1 times [2025-03-04 04:33:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:43,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162324220] [2025-03-04 04:33:43,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:43,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:44,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-04 04:33:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-04 04:33:44,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:44,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-03-04 04:33:44,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:44,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162324220] [2025-03-04 04:33:44,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162324220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:44,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:44,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782151127] [2025-03-04 04:33:44,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:44,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:44,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:44,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:44,599 INFO L87 Difference]: Start difference. First operand 2165 states and 3022 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:45,144 INFO L93 Difference]: Finished difference Result 5467 states and 7541 transitions. [2025-03-04 04:33:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 195 [2025-03-04 04:33:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:45,167 INFO L225 Difference]: With dead ends: 5467 [2025-03-04 04:33:45,167 INFO L226 Difference]: Without dead ends: 3343 [2025-03-04 04:33:45,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:45,176 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 847 mSDsluCounter, 1455 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:45,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 3034 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:33:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3343 states. [2025-03-04 04:33:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3343 to 3319. [2025-03-04 04:33:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 2209 states have (on average 1.2838388411045722) internal successors, (2836), 2268 states have internal predecessors, (2836), 862 states have call successors, (862), 248 states have call predecessors, (862), 247 states have return successors, (848), 836 states have call predecessors, (848), 848 states have call successors, (848) [2025-03-04 04:33:45,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4546 transitions. [2025-03-04 04:33:45,281 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4546 transitions. Word has length 195 [2025-03-04 04:33:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:45,282 INFO L471 AbstractCegarLoop]: Abstraction has 3319 states and 4546 transitions. [2025-03-04 04:33:45,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4546 transitions. [2025-03-04 04:33:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 04:33:45,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:45,286 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:33:45,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1337885105, now seen corresponding path program 1 times [2025-03-04 04:33:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:45,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112010959] [2025-03-04 04:33:45,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:45,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:46,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 04:33:46,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 04:33:46,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:46,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2025-03-04 04:33:46,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:46,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112010959] [2025-03-04 04:33:46,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112010959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:46,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:46,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785602081] [2025-03-04 04:33:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:46,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:46,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:46,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:46,537 INFO L87 Difference]: Start difference. First operand 3319 states and 4546 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 04:33:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:46,948 INFO L93 Difference]: Finished difference Result 8250 states and 11283 transitions. [2025-03-04 04:33:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:46,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 216 [2025-03-04 04:33:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:46,973 INFO L225 Difference]: With dead ends: 8250 [2025-03-04 04:33:46,973 INFO L226 Difference]: Without dead ends: 4982 [2025-03-04 04:33:46,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:46,985 INFO L435 NwaCegarLoop]: 2171 mSDtfsCounter, 1058 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3641 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:46,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3641 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:33:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2025-03-04 04:33:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4955. [2025-03-04 04:33:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4955 states, 3324 states have (on average 1.2885078219013237) internal successors, (4283), 3413 states have internal predecessors, (4283), 1250 states have call successors, (1250), 381 states have call predecessors, (1250), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-03-04 04:33:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 6769 transitions. [2025-03-04 04:33:47,137 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 6769 transitions. Word has length 216 [2025-03-04 04:33:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:47,137 INFO L471 AbstractCegarLoop]: Abstraction has 4955 states and 6769 transitions. [2025-03-04 04:33:47,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 04:33:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 6769 transitions. [2025-03-04 04:33:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-04 04:33:47,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:47,139 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:33:47,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1167950130, now seen corresponding path program 1 times [2025-03-04 04:33:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124547051] [2025-03-04 04:33:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:47,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-04 04:33:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-04 04:33:47,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:47,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:48,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:48,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124547051] [2025-03-04 04:33:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124547051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:48,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:48,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:48,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724549664] [2025-03-04 04:33:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:48,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:48,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:48,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:48,160 INFO L87 Difference]: Start difference. First operand 4955 states and 6769 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:48,313 INFO L93 Difference]: Finished difference Result 4957 states and 6770 transitions. [2025-03-04 04:33:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:48,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 212 [2025-03-04 04:33:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:48,337 INFO L225 Difference]: With dead ends: 4957 [2025-03-04 04:33:48,338 INFO L226 Difference]: Without dead ends: 4954 [2025-03-04 04:33:48,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:48,342 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 1510 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:48,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1548 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:33:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2025-03-04 04:33:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4954. [2025-03-04 04:33:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4954 states, 3324 states have (on average 1.2882069795427196) internal successors, (4282), 3412 states have internal predecessors, (4282), 1249 states have call successors, (1249), 381 states have call predecessors, (1249), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-03-04 04:33:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 6767 transitions. [2025-03-04 04:33:48,508 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 6767 transitions. Word has length 212 [2025-03-04 04:33:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:48,508 INFO L471 AbstractCegarLoop]: Abstraction has 4954 states and 6767 transitions. [2025-03-04 04:33:48,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:48,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 6767 transitions. [2025-03-04 04:33:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-04 04:33:48,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:48,511 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:48,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:33:48,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1847674408, now seen corresponding path program 1 times [2025-03-04 04:33:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:48,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293427124] [2025-03-04 04:33:48,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:48,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:49,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-04 04:33:49,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-04 04:33:49,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:49,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:49,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293427124] [2025-03-04 04:33:49,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293427124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:49,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:49,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:49,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069566516] [2025-03-04 04:33:49,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:49,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:49,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:49,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:49,544 INFO L87 Difference]: Start difference. First operand 4954 states and 6767 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:49,779 INFO L93 Difference]: Finished difference Result 4956 states and 6768 transitions. [2025-03-04 04:33:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 213 [2025-03-04 04:33:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:49,814 INFO L225 Difference]: With dead ends: 4956 [2025-03-04 04:33:49,814 INFO L226 Difference]: Without dead ends: 4953 [2025-03-04 04:33:49,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:49,820 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 1507 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:49,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1546 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:33:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4953 states. [2025-03-04 04:33:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4953 to 4953. [2025-03-04 04:33:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4953 states, 3324 states have (on average 1.2879061371841156) internal successors, (4281), 3411 states have internal predecessors, (4281), 1248 states have call successors, (1248), 381 states have call predecessors, (1248), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-03-04 04:33:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 6765 transitions. [2025-03-04 04:33:50,073 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 6765 transitions. Word has length 213 [2025-03-04 04:33:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:50,074 INFO L471 AbstractCegarLoop]: Abstraction has 4953 states and 6765 transitions. [2025-03-04 04:33:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 6765 transitions. [2025-03-04 04:33:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-04 04:33:50,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:50,076 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:50,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:33:50,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:50,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1444291569, now seen corresponding path program 1 times [2025-03-04 04:33:50,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:50,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79713441] [2025-03-04 04:33:50,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:50,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:50,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-04 04:33:51,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-04 04:33:51,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:51,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:51,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79713441] [2025-03-04 04:33:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79713441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:51,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:51,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374427236] [2025-03-04 04:33:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:51,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:51,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:51,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:51,178 INFO L87 Difference]: Start difference. First operand 4953 states and 6765 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:51,368 INFO L93 Difference]: Finished difference Result 4955 states and 6766 transitions. [2025-03-04 04:33:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:51,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 214 [2025-03-04 04:33:51,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:51,394 INFO L225 Difference]: With dead ends: 4955 [2025-03-04 04:33:51,395 INFO L226 Difference]: Without dead ends: 4952 [2025-03-04 04:33:51,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:51,400 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 1504 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:51,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1544 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:33:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4952 states. [2025-03-04 04:33:51,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4952 to 4952. [2025-03-04 04:33:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4952 states, 3324 states have (on average 1.2876052948255114) internal successors, (4280), 3410 states have internal predecessors, (4280), 1247 states have call successors, (1247), 381 states have call predecessors, (1247), 380 states have return successors, (1236), 1220 states have call predecessors, (1236), 1236 states have call successors, (1236) [2025-03-04 04:33:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4952 states to 4952 states and 6763 transitions. [2025-03-04 04:33:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4952 states and 6763 transitions. Word has length 214 [2025-03-04 04:33:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:51,570 INFO L471 AbstractCegarLoop]: Abstraction has 4952 states and 6763 transitions. [2025-03-04 04:33:51,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4952 states and 6763 transitions. [2025-03-04 04:33:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-04 04:33:51,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:51,572 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:51,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:33:51,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1824326471, now seen corresponding path program 1 times [2025-03-04 04:33:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:51,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659307124] [2025-03-04 04:33:51,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-04 04:33:52,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 04:33:52,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:52,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659307124] [2025-03-04 04:33:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659307124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:52,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820560409] [2025-03-04 04:33:52,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:52,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:52,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:52,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:52,560 INFO L87 Difference]: Start difference. First operand 4952 states and 6763 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:53,055 INFO L93 Difference]: Finished difference Result 14493 states and 19801 transitions. [2025-03-04 04:33:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:53,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 215 [2025-03-04 04:33:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:53,125 INFO L225 Difference]: With dead ends: 14493 [2025-03-04 04:33:53,126 INFO L226 Difference]: Without dead ends: 9596 [2025-03-04 04:33:53,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:53,148 INFO L435 NwaCegarLoop]: 1918 mSDtfsCounter, 1460 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 3343 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:53,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 3343 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:33:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9596 states. [2025-03-04 04:33:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9596 to 9560. [2025-03-04 04:33:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9560 states, 6458 states have (on average 1.2909569526169093) internal successors, (8337), 6634 states have internal predecessors, (8337), 2363 states have call successors, (2363), 748 states have call predecessors, (2363), 738 states have return successors, (2350), 2290 states have call predecessors, (2350), 2350 states have call successors, (2350) [2025-03-04 04:33:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 13050 transitions. [2025-03-04 04:33:53,497 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 13050 transitions. Word has length 215 [2025-03-04 04:33:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:53,497 INFO L471 AbstractCegarLoop]: Abstraction has 9560 states and 13050 transitions. [2025-03-04 04:33:53,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 13050 transitions. [2025-03-04 04:33:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-04 04:33:53,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:53,500 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:33:53,501 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:53,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash -720507568, now seen corresponding path program 1 times [2025-03-04 04:33:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110159537] [2025-03-04 04:33:53,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:54,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 04:33:54,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 04:33:54,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110159537] [2025-03-04 04:33:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110159537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:54,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:54,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934544829] [2025-03-04 04:33:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:54,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:54,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:54,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:54,631 INFO L87 Difference]: Start difference. First operand 9560 states and 13050 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:55,001 INFO L93 Difference]: Finished difference Result 10572 states and 13998 transitions. [2025-03-04 04:33:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 216 [2025-03-04 04:33:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:55,039 INFO L225 Difference]: With dead ends: 10572 [2025-03-04 04:33:55,040 INFO L226 Difference]: Without dead ends: 10568 [2025-03-04 04:33:55,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:55,047 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 1290 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:55,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1923 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:33:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10568 states. [2025-03-04 04:33:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10568 to 10562. [2025-03-04 04:33:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 7170 states have (on average 1.2722454672245467) internal successors, (9122), 7340 states have internal predecessors, (9122), 2433 states have call successors, (2433), 972 states have call predecessors, (2433), 958 states have return successors, (2422), 2362 states have call predecessors, (2422), 2422 states have call successors, (2422) [2025-03-04 04:33:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 13977 transitions. [2025-03-04 04:33:55,409 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 13977 transitions. Word has length 216 [2025-03-04 04:33:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:55,410 INFO L471 AbstractCegarLoop]: Abstraction has 10562 states and 13977 transitions. [2025-03-04 04:33:55,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 13977 transitions. [2025-03-04 04:33:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-04 04:33:55,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:55,413 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:55,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:33:55,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:55,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:55,413 INFO L85 PathProgramCache]: Analyzing trace with hash -861860966, now seen corresponding path program 1 times [2025-03-04 04:33:55,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:55,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924005393] [2025-03-04 04:33:55,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:55,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:56,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-04 04:33:56,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-04 04:33:56,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:56,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:33:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924005393] [2025-03-04 04:33:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924005393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147307723] [2025-03-04 04:33:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:56,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:56,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:56,391 INFO L87 Difference]: Start difference. First operand 10562 states and 13977 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:33:57,332 INFO L93 Difference]: Finished difference Result 29937 states and 39846 transitions. [2025-03-04 04:33:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:33:57,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 217 [2025-03-04 04:33:57,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:33:57,404 INFO L225 Difference]: With dead ends: 29937 [2025-03-04 04:33:57,404 INFO L226 Difference]: Without dead ends: 19420 [2025-03-04 04:33:57,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:57,445 INFO L435 NwaCegarLoop]: 1682 mSDtfsCounter, 1447 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:33:57,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 3028 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 04:33:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19420 states. [2025-03-04 04:33:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19420 to 19279. [2025-03-04 04:33:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19279 states, 13183 states have (on average 1.2811954790260183) internal successors, (16890), 13523 states have internal predecessors, (16890), 4388 states have call successors, (4388), 1752 states have call predecessors, (4388), 1707 states have return successors, (4406), 4201 states have call predecessors, (4406), 4374 states have call successors, (4406) [2025-03-04 04:33:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19279 states to 19279 states and 25684 transitions. [2025-03-04 04:33:58,534 INFO L78 Accepts]: Start accepts. Automaton has 19279 states and 25684 transitions. Word has length 217 [2025-03-04 04:33:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:33:58,536 INFO L471 AbstractCegarLoop]: Abstraction has 19279 states and 25684 transitions. [2025-03-04 04:33:58,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-04 04:33:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19279 states and 25684 transitions. [2025-03-04 04:33:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-04 04:33:58,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:33:58,544 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:33:58,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:33:58,544 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:33:58,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:33:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1463680861, now seen corresponding path program 1 times [2025-03-04 04:33:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:33:58,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211998429] [2025-03-04 04:33:58,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:33:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:33:59,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-04 04:33:59,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-04 04:33:59,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:33:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:33:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-04 04:33:59,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:33:59,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211998429] [2025-03-04 04:33:59,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211998429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:33:59,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:33:59,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:33:59,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932503045] [2025-03-04 04:33:59,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:33:59,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:33:59,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:33:59,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:33:59,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:33:59,683 INFO L87 Difference]: Start difference. First operand 19279 states and 25684 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 04:34:03,708 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-04 04:34:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:05,562 INFO L93 Difference]: Finished difference Result 48234 states and 64079 transitions. [2025-03-04 04:34:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 279 [2025-03-04 04:34:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:05,730 INFO L225 Difference]: With dead ends: 48234 [2025-03-04 04:34:05,731 INFO L226 Difference]: Without dead ends: 29010 [2025-03-04 04:34:05,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:05,816 INFO L435 NwaCegarLoop]: 2270 mSDtfsCounter, 1190 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 3683 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:05,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 3683 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 04:34:05,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29010 states. [2025-03-04 04:34:06,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29010 to 28935. [2025-03-04 04:34:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28935 states, 19931 states have (on average 1.2761025538106467) internal successors, (25434), 20435 states have internal predecessors, (25434), 6363 states have call successors, (6363), 2709 states have call predecessors, (6363), 2640 states have return successors, (6381), 6094 states have call predecessors, (6381), 6349 states have call successors, (6381) [2025-03-04 04:34:07,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28935 states to 28935 states and 38178 transitions. [2025-03-04 04:34:07,098 INFO L78 Accepts]: Start accepts. Automaton has 28935 states and 38178 transitions. Word has length 279 [2025-03-04 04:34:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:07,099 INFO L471 AbstractCegarLoop]: Abstraction has 28935 states and 38178 transitions. [2025-03-04 04:34:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 04:34:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 28935 states and 38178 transitions. [2025-03-04 04:34:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 04:34:07,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:07,106 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:34:07,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1299513339, now seen corresponding path program 1 times [2025-03-04 04:34:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797316371] [2025-03-04 04:34:07,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:07,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-04 04:34:07,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 04:34:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:07,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:08,136 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2025-03-04 04:34:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797316371] [2025-03-04 04:34:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797316371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:08,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:34:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699571162] [2025-03-04 04:34:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:34:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:08,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:34:08,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:08,138 INFO L87 Difference]: Start difference. First operand 28935 states and 38178 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 04:34:12,163 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-04 04:34:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:12,978 INFO L93 Difference]: Finished difference Result 43733 states and 57666 transitions. [2025-03-04 04:34:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 274 [2025-03-04 04:34:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:13,060 INFO L225 Difference]: With dead ends: 43733 [2025-03-04 04:34:13,060 INFO L226 Difference]: Without dead ends: 14850 [2025-03-04 04:34:13,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:13,139 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 12 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3086 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:13,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3086 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:34:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14850 states. [2025-03-04 04:34:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14850 to 14655. [2025-03-04 04:34:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14655 states, 10096 states have (on average 1.2777337559429478) internal successors, (12900), 10353 states have internal predecessors, (12900), 3220 states have call successors, (3220), 1374 states have call predecessors, (3220), 1338 states have return successors, (3222), 3081 states have call predecessors, (3222), 3206 states have call successors, (3222) [2025-03-04 04:34:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14655 states to 14655 states and 19342 transitions. [2025-03-04 04:34:13,788 INFO L78 Accepts]: Start accepts. Automaton has 14655 states and 19342 transitions. Word has length 274 [2025-03-04 04:34:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:13,789 INFO L471 AbstractCegarLoop]: Abstraction has 14655 states and 19342 transitions. [2025-03-04 04:34:13,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-04 04:34:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 14655 states and 19342 transitions. [2025-03-04 04:34:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-04 04:34:13,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:13,793 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:13,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:34:13,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:13,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -3504120, now seen corresponding path program 1 times [2025-03-04 04:34:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:13,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167207639] [2025-03-04 04:34:13,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:14,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-04 04:34:14,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-04 04:34:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-03-04 04:34:14,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:14,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167207639] [2025-03-04 04:34:14,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167207639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:14,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:14,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:34:14,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788052030] [2025-03-04 04:34:14,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:14,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:34:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:14,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:34:14,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:14,913 INFO L87 Difference]: Start difference. First operand 14655 states and 19342 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:34:18,938 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-04 04:34:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:19,460 INFO L93 Difference]: Finished difference Result 14663 states and 19348 transitions. [2025-03-04 04:34:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 286 [2025-03-04 04:34:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:19,523 INFO L225 Difference]: With dead ends: 14663 [2025-03-04 04:34:19,523 INFO L226 Difference]: Without dead ends: 14660 [2025-03-04 04:34:19,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:19,533 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 336 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:19,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 2950 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:34:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14660 states. [2025-03-04 04:34:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14660 to 14654. [2025-03-04 04:34:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14654 states, 10096 states have (on average 1.276446117274168) internal successors, (12887), 10352 states have internal predecessors, (12887), 3219 states have call successors, (3219), 1374 states have call predecessors, (3219), 1338 states have return successors, (3222), 3081 states have call predecessors, (3222), 3206 states have call successors, (3222) [2025-03-04 04:34:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14654 states to 14654 states and 19328 transitions. [2025-03-04 04:34:20,176 INFO L78 Accepts]: Start accepts. Automaton has 14654 states and 19328 transitions. Word has length 286 [2025-03-04 04:34:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:20,177 INFO L471 AbstractCegarLoop]: Abstraction has 14654 states and 19328 transitions. [2025-03-04 04:34:20,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:34:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14654 states and 19328 transitions. [2025-03-04 04:34:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-04 04:34:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:20,182 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:34:20,182 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:20,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 690339394, now seen corresponding path program 1 times [2025-03-04 04:34:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843038063] [2025-03-04 04:34:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:21,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-03-04 04:34:21,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-03-04 04:34:21,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-04 04:34:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:21,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843038063] [2025-03-04 04:34:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843038063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:34:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645506888] [2025-03-04 04:34:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:21,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:34:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:34:21,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:21,703 INFO L87 Difference]: Start difference. First operand 14654 states and 19328 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 04:34:25,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:34:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:26,856 INFO L93 Difference]: Finished difference Result 34261 states and 45172 transitions. [2025-03-04 04:34:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 307 [2025-03-04 04:34:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:26,949 INFO L225 Difference]: With dead ends: 34261 [2025-03-04 04:34:26,949 INFO L226 Difference]: Without dead ends: 19771 [2025-03-04 04:34:26,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:26,999 INFO L435 NwaCegarLoop]: 1980 mSDtfsCounter, 1199 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:26,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 3294 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 04:34:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19771 states. [2025-03-04 04:34:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19771 to 19716. [2025-03-04 04:34:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19716 states, 13690 states have (on average 1.279035792549306) internal successors, (17510), 14044 states have internal predecessors, (17510), 4197 states have call successors, (4197), 1868 states have call predecessors, (4197), 1828 states have return successors, (4208), 4025 states have call predecessors, (4208), 4184 states have call successors, (4208) [2025-03-04 04:34:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19716 states to 19716 states and 25915 transitions. [2025-03-04 04:34:27,684 INFO L78 Accepts]: Start accepts. Automaton has 19716 states and 25915 transitions. Word has length 307 [2025-03-04 04:34:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:27,684 INFO L471 AbstractCegarLoop]: Abstraction has 19716 states and 25915 transitions. [2025-03-04 04:34:27,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 04:34:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19716 states and 25915 transitions. [2025-03-04 04:34:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-04 04:34:27,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:27,693 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:27,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:34:27,693 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:27,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1231059099, now seen corresponding path program 1 times [2025-03-04 04:34:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343820476] [2025-03-04 04:34:27,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-04 04:34:28,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-04 04:34:28,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:28,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2025-03-04 04:34:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343820476] [2025-03-04 04:34:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343820476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:28,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:28,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:34:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755556576] [2025-03-04 04:34:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:34:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:28,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:34:28,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:28,998 INFO L87 Difference]: Start difference. First operand 19716 states and 25915 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:34:33,022 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-04 04:34:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:33,893 INFO L93 Difference]: Finished difference Result 39280 states and 51642 transitions. [2025-03-04 04:34:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:33,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 312 [2025-03-04 04:34:33,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:33,986 INFO L225 Difference]: With dead ends: 39280 [2025-03-04 04:34:33,986 INFO L226 Difference]: Without dead ends: 19728 [2025-03-04 04:34:34,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:34,041 INFO L435 NwaCegarLoop]: 2614 mSDtfsCounter, 1351 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:34,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 4093 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-04 04:34:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19728 states. [2025-03-04 04:34:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19728 to 19621. [2025-03-04 04:34:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19621 states, 13619 states have (on average 1.276452015566488) internal successors, (17384), 13989 states have internal predecessors, (17384), 4178 states have call successors, (4178), 1848 states have call predecessors, (4178), 1823 states have return successors, (4161), 4005 states have call predecessors, (4161), 4149 states have call successors, (4161) [2025-03-04 04:34:34,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19621 states to 19621 states and 25723 transitions. [2025-03-04 04:34:34,682 INFO L78 Accepts]: Start accepts. Automaton has 19621 states and 25723 transitions. Word has length 312 [2025-03-04 04:34:34,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:34,683 INFO L471 AbstractCegarLoop]: Abstraction has 19621 states and 25723 transitions. [2025-03-04 04:34:34,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:34:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19621 states and 25723 transitions. [2025-03-04 04:34:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 04:34:34,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:34,689 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:34,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:34:34,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:34,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:34,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1905684247, now seen corresponding path program 1 times [2025-03-04 04:34:34,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:34,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208644875] [2025-03-04 04:34:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:35,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 04:34:35,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 04:34:35,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:35,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-03-04 04:34:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:36,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208644875] [2025-03-04 04:34:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208644875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:34:36,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781381195] [2025-03-04 04:34:36,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:36,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:34:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:36,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:34:36,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:34:36,137 INFO L87 Difference]: Start difference. First operand 19621 states and 25723 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:34:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:37,012 INFO L93 Difference]: Finished difference Result 20416 states and 26503 transitions. [2025-03-04 04:34:37,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:34:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 320 [2025-03-04 04:34:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:37,100 INFO L225 Difference]: With dead ends: 20416 [2025-03-04 04:34:37,100 INFO L226 Difference]: Without dead ends: 18939 [2025-03-04 04:34:37,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:34:37,116 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 7 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6167 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:37,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6167 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 04:34:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18939 states. [2025-03-04 04:34:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18939 to 18795. [2025-03-04 04:34:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18795 states, 13110 states have (on average 1.2732265446224256) internal successors, (16692), 13432 states have internal predecessors, (16692), 3899 states have call successors, (3899), 1810 states have call predecessors, (3899), 1785 states have return successors, (3884), 3761 states have call predecessors, (3884), 3872 states have call successors, (3884) [2025-03-04 04:34:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18795 states to 18795 states and 24475 transitions. [2025-03-04 04:34:37,745 INFO L78 Accepts]: Start accepts. Automaton has 18795 states and 24475 transitions. Word has length 320 [2025-03-04 04:34:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:37,745 INFO L471 AbstractCegarLoop]: Abstraction has 18795 states and 24475 transitions. [2025-03-04 04:34:37,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-04 04:34:37,746 INFO L276 IsEmpty]: Start isEmpty. Operand 18795 states and 24475 transitions. [2025-03-04 04:34:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2025-03-04 04:34:37,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:37,751 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:34:37,751 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -2142829958, now seen corresponding path program 1 times [2025-03-04 04:34:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31368040] [2025-03-04 04:34:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:38,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 319 statements into 1 equivalence classes. [2025-03-04 04:34:38,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 319 of 319 statements. [2025-03-04 04:34:38,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:38,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-03-04 04:34:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31368040] [2025-03-04 04:34:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31368040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:34:38,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240942736] [2025-03-04 04:34:38,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:38,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:34:38,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:38,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:34:38,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:38,738 INFO L87 Difference]: Start difference. First operand 18795 states and 24475 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 04:34:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:39,371 INFO L93 Difference]: Finished difference Result 37438 states and 48763 transitions. [2025-03-04 04:34:39,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:34:39,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 319 [2025-03-04 04:34:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:39,462 INFO L225 Difference]: With dead ends: 37438 [2025-03-04 04:34:39,462 INFO L226 Difference]: Without dead ends: 18807 [2025-03-04 04:34:39,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:34:39,511 INFO L435 NwaCegarLoop]: 1538 mSDtfsCounter, 0 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:39,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3071 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:34:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18807 states. [2025-03-04 04:34:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18807 to 18807. [2025-03-04 04:34:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18807 states, 13122 states have (on average 1.2729766803840878) internal successors, (16704), 13444 states have internal predecessors, (16704), 3899 states have call successors, (3899), 1810 states have call predecessors, (3899), 1785 states have return successors, (3884), 3761 states have call predecessors, (3884), 3872 states have call successors, (3884) [2025-03-04 04:34:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18807 states to 18807 states and 24487 transitions. [2025-03-04 04:34:40,265 INFO L78 Accepts]: Start accepts. Automaton has 18807 states and 24487 transitions. Word has length 319 [2025-03-04 04:34:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:40,265 INFO L471 AbstractCegarLoop]: Abstraction has 18807 states and 24487 transitions. [2025-03-04 04:34:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-04 04:34:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 18807 states and 24487 transitions. [2025-03-04 04:34:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 04:34:40,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:40,271 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 04:34:40,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash -553438446, now seen corresponding path program 1 times [2025-03-04 04:34:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57077103] [2025-03-04 04:34:40,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:34:41,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-03-04 04:34:41,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 04:34:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:34:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:34:41,462 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-03-04 04:34:41,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:34:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57077103] [2025-03-04 04:34:41,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57077103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:34:41,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:34:41,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:34:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847677250] [2025-03-04 04:34:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:34:41,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:34:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:34:41,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:34:41,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:34:41,465 INFO L87 Difference]: Start difference. First operand 18807 states and 24487 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 04:34:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:34:43,174 INFO L93 Difference]: Finished difference Result 37563 states and 48954 transitions. [2025-03-04 04:34:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 04:34:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 320 [2025-03-04 04:34:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:34:43,259 INFO L225 Difference]: With dead ends: 37563 [2025-03-04 04:34:43,259 INFO L226 Difference]: Without dead ends: 18920 [2025-03-04 04:34:43,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:34:43,302 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 25 mSDsluCounter, 4635 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 6216 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:34:43,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 6216 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 04:34:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18920 states. [2025-03-04 04:34:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18920 to 18837. [2025-03-04 04:34:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18837 states, 13134 states have (on average 1.2720420283234353) internal successors, (16707), 13459 states have internal predecessors, (16707), 3917 states have call successors, (3917), 1810 states have call predecessors, (3917), 1785 states have return successors, (3902), 3776 states have call predecessors, (3902), 3890 states have call successors, (3902) [2025-03-04 04:34:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18837 states to 18837 states and 24526 transitions. [2025-03-04 04:34:43,935 INFO L78 Accepts]: Start accepts. Automaton has 18837 states and 24526 transitions. Word has length 320 [2025-03-04 04:34:43,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:34:43,936 INFO L471 AbstractCegarLoop]: Abstraction has 18837 states and 24526 transitions. [2025-03-04 04:34:43,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 04:34:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 18837 states and 24526 transitions. [2025-03-04 04:34:43,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2025-03-04 04:34:43,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:34:43,941 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:34:43,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 04:34:43,941 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:34:43,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:34:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 895873810, now seen corresponding path program 1 times [2025-03-04 04:34:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:34:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941995394] [2025-03-04 04:34:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:34:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms