./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.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 037f6e8e4bd200c248573cc05d02b8c7bc97a7f8cca3135a2970ec46958bec59 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:12:23,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:12:23,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:12:23,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:12:23,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:12:23,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:12:23,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:12:23,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:12:23,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:12:23,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:12:23,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:12:23,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:12:23,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:12:23,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:12:23,344 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:12:23,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:12:23,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:12:23,345 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:12:23,345 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:12:23,346 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:12:23,346 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:12:23,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:12:23,347 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 -> 037f6e8e4bd200c248573cc05d02b8c7bc97a7f8cca3135a2970ec46958bec59 [2025-03-08 19:12:23,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:12:23,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:12:23,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:12:23,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:12:23,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:12:23,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-08 19:12:24,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a63279/cde6d6eea0774366a9808fdcb0eca45b/FLAG473a25feb [2025-03-08 19:12:25,367 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:12:25,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-08 19:12:25,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a63279/cde6d6eea0774366a9808fdcb0eca45b/FLAG473a25feb [2025-03-08 19:12:25,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/603a63279/cde6d6eea0774366a9808fdcb0eca45b [2025-03-08 19:12:25,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:12:25,438 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:12:25,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:12:25,441 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:12:25,444 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:12:25,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:12:25" (1/1) ... [2025-03-08 19:12:25,445 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:25, skipping insertion in model container [2025-03-08 19:12:25,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:12:25" (1/1) ... [2025-03-08 19:12:25,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:12:26,242 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] [2025-03-08 19:12:26,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:12:26,829 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:12:26,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] [2025-03-08 19:12:27,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:12:27,096 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:12:27,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27 WrapperNode [2025-03-08 19:12:27,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:12:27,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:12:27,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:12:27,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:12:27,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,224 INFO L138 Inliner]: procedures = 175, calls = 763, calls flagged for inlining = 71, calls inlined = 62, statements flattened = 1972 [2025-03-08 19:12:27,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:12:27,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:12:27,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:12:27,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:12:27,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,486 INFO L175 MemorySlicer]: Split 365 memory accesses to 15 slices as follows [2, 261, 3, 20, 3, 3, 3, 2, 3, 3, 10, 2, 44, 2, 4]. 72 percent of accesses are in the largest equivalence class. The 61 initializations are split as follows [2, 26, 3, 15, 3, 3, 3, 0, 3, 3, 0, 0, 0, 0, 0]. The 159 writes are split as follows [0, 100, 0, 2, 0, 0, 0, 1, 0, 0, 9, 1, 44, 1, 1]. [2025-03-08 19:12:27,486 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:12:27,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:12:27,588 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:12:27,588 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:12:27,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (1/1) ... [2025-03-08 19:12:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:12:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:12:27,615 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:12:27,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:12:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_cleanup_scatter [2025-03-08 19:12:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_cleanup_scatter [2025-03-08 19:12:27,640 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-08 19:12:27,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_submit_ctrl_out [2025-03-08 19:12:27,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_submit_ctrl_out [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:12:27,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-03-08 19:12:27,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-08 19:12:27,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-08 19:12:27,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:12:27,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:12:27,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_diag_write32 [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_diag_write32 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_destroy [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_destroy [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_get_default_pipe [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_get_default_pipe [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_power_off [2025-03-08 19:12:27,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_power_off [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:12:27,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:12:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:12:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_bmi_read [2025-03-08 19:12:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_bmi_read [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-03-08 19:12:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:12:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_stop [2025-03-08 19:12:27,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_stop [2025-03-08 19:12:27,648 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_get_free_queue_number [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_get_free_queue_number [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_free_urb_to_pipe [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_free_urb_to_pipe [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_flush_all [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_flush_all [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-08 19:12:27,649 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:12:27,649 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:12:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_warn [2025-03-08 19:12:27,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_warn [2025-03-08 19:12:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_ctrl_msg_exchange [2025-03-08 19:12:27,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_ctrl_msg_exchange [2025-03-08 19:12:27,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_cleanup_recv_urb [2025-03-08 19:12:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_cleanup_recv_urb [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:12:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_submit_ctrl_in [2025-03-08 19:12:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_submit_ctrl_in [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_power_on [2025-03-08 19:12:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_power_on [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_priv [2025-03-08 19:12:27,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_priv [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:12:27,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-08 19:12:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_err [2025-03-08 19:12:27,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_err [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:12:27,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_alloc_urb_from_pipe [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_alloc_urb_from_pipe [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_remove [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_remove [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-08 19:12:27,653 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:12:27,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_post_recv_transfers [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_post_recv_transfers [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_map_service_pipe [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_map_service_pipe [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_dbg [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_dbg [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_send [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_send [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-08 19:12:27,654 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-08 19:12:27,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:12:27,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:12:27,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:12:27,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:12:27,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:12:28,139 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:12:28,141 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:12:28,210 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8762: havoc kmemdup_#t~ret422#1.base, kmemdup_#t~ret422#1.offset; [2025-03-08 19:12:28,219 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6657: havoc dev_get_drvdata_#t~mem39#1.base, dev_get_drvdata_#t~mem39#1.offset; [2025-03-08 19:12:28,225 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8817: havoc #t~nondet432; [2025-03-08 19:12:28,228 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:12:28,419 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8756: havoc #t~nondet421; [2025-03-08 19:12:28,563 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8749: havoc #t~nondet420; [2025-03-08 19:12:28,594 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6634: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-03-08 19:12:28,650 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8720: havoc #t~nondet417; [2025-03-08 19:12:28,719 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8787: havoc #t~ret428.base, #t~ret428.offset; [2025-03-08 19:12:28,743 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6867: havoc #t~mem81;havoc #t~bitwise82; [2025-03-08 19:12:28,784 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7597: havoc #t~mem278; [2025-03-08 19:12:28,870 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6929: havoc #t~mem112.base, #t~mem112.offset; [2025-03-08 19:12:28,874 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8794: havoc #t~nondet429; [2025-03-08 19:12:28,891 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc list_empty_#t~mem6#1.base, list_empty_#t~mem6#1.offset; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7703: call ULTIMATE.dealloc(ath6kl_usb_diag_read32_~#resp_len~0#1.base, ath6kl_usb_diag_read32_~#resp_len~0#1.offset);havoc ath6kl_usb_diag_read32_~#resp_len~0#1.base, ath6kl_usb_diag_read32_~#resp_len~0#1.offset; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8729: havoc ath6kl_core_create_#t~ret418#1.base, ath6kl_core_create_#t~ret418#1.offset; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8766: havoc ldv_probe_2_#t~nondet423#1; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6685: call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8736: havoc ath6kl_core_init_#t~nondet419#1; [2025-03-08 19:12:33,703 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8803: havoc usb_get_dev_#t~ret430#1.base, usb_get_dev_#t~ret430#1.offset; [2025-03-08 19:12:33,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7355: call ULTIMATE.dealloc(ath6kl_usb_create_~#__key~2#1.base, ath6kl_usb_create_~#__key~2#1.offset);havoc ath6kl_usb_create_~#__key~2#1.base, ath6kl_usb_create_~#__key~2#1.offset;call ULTIMATE.dealloc(ath6kl_usb_create_~#__key___0~1#1.base, ath6kl_usb_create_~#__key___0~1#1.offset);havoc ath6kl_usb_create_~#__key___0~1#1.base, ath6kl_usb_create_~#__key___0~1#1.offset;call ULTIMATE.dealloc(ath6kl_usb_create_~#__constr_expr_0~0#1.base, ath6kl_usb_create_~#__constr_expr_0~0#1.offset);havoc ath6kl_usb_create_~#__constr_expr_0~0#1.base, ath6kl_usb_create_~#__constr_expr_0~0#1.offset; [2025-03-08 19:12:33,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6830: call ULTIMATE.dealloc(init_usb_anchor_~#__key~1#1.base, init_usb_anchor_~#__key~1#1.offset);havoc init_usb_anchor_~#__key~1#1.base, init_usb_anchor_~#__key~1#1.offset;call ULTIMATE.dealloc(init_usb_anchor_~#__key___0~0#1.base, init_usb_anchor_~#__key___0~0#1.offset);havoc init_usb_anchor_~#__key___0~0#1.base, init_usb_anchor_~#__key___0~0#1.offset; [2025-03-08 19:12:33,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8813: havoc usb_register_driver_#t~nondet431#1; [2025-03-08 19:12:33,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7066: call ULTIMATE.dealloc(ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.base, ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.offset);havoc ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.base, ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.offset; [2025-03-08 19:12:33,704 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7992: 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_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-08 19:12:33,977 INFO L? ?]: Removed 906 outVars from TransFormulas that were not future-live. [2025-03-08 19:12:33,977 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:12:34,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:12:34,019 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:12:34,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:34 BoogieIcfgContainer [2025-03-08 19:12:34,020 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:12:34,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:12:34,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:12:34,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:12:34,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:12:25" (1/3) ... [2025-03-08 19:12:34,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf3b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:34, skipping insertion in model container [2025-03-08 19:12:34,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:12:27" (2/3) ... [2025-03-08 19:12:34,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf3b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:12:34, skipping insertion in model container [2025-03-08 19:12:34,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:12:34" (3/3) ... [2025-03-08 19:12:34,028 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-08 19:12:34,040 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:12:34,044 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i that has 68 procedures, 870 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-03-08 19:12:34,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:12:34,116 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;@43f858c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:12:34,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:12:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 580 states have (on average 1.3431034482758621) internal successors, (779), 595 states have internal predecessors, (779), 185 states have call successors, (185), 55 states have call predecessors, (185), 54 states have return successors, (181), 180 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-08 19:12:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 19:12:34,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:34,138 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:34,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:34,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1985095916, now seen corresponding path program 1 times [2025-03-08 19:12:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:34,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637107970] [2025-03-08 19:12:34,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:34,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:34,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 19:12:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 19:12:34,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:34,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-08 19:12:35,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637107970] [2025-03-08 19:12:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637107970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:35,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:35,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104214073] [2025-03-08 19:12:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:35,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:35,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:35,097 INFO L87 Difference]: Start difference. First operand has 821 states, 580 states have (on average 1.3431034482758621) internal successors, (779), 595 states have internal predecessors, (779), 185 states have call successors, (185), 55 states have call predecessors, (185), 54 states have return successors, (181), 180 states have call predecessors, (181), 181 states have call successors, (181) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 19:12:39,124 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-08 19:12:39,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:39,377 INFO L93 Difference]: Finished difference Result 2392 states and 3441 transitions. [2025-03-08 19:12:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:39,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-08 19:12:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:39,407 INFO L225 Difference]: With dead ends: 2392 [2025-03-08 19:12:39,408 INFO L226 Difference]: Without dead ends: 1560 [2025-03-08 19:12:39,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:39,421 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 1054 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:39,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2226 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:12:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-08 19:12:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2025-03-08 19:12:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1110 states have (on average 1.3216216216216217) internal successors, (1467), 1128 states have internal predecessors, (1467), 345 states have call successors, (345), 105 states have call predecessors, (345), 104 states have return successors, (344), 342 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-08 19:12:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2156 transitions. [2025-03-08 19:12:39,595 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2156 transitions. Word has length 96 [2025-03-08 19:12:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:39,596 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2156 transitions. [2025-03-08 19:12:39,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-08 19:12:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2156 transitions. [2025-03-08 19:12:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 19:12:39,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:39,603 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:12:39,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 53074234, now seen corresponding path program 1 times [2025-03-08 19:12:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157660257] [2025-03-08 19:12:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:39,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 19:12:39,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 19:12:39,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:39,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:12:40,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157660257] [2025-03-08 19:12:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157660257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:12:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209295119] [2025-03-08 19:12:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:40,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:12:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:40,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:12:40,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:12:40,108 INFO L87 Difference]: Start difference. First operand 1560 states and 2156 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 19:12:40,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:40,269 INFO L93 Difference]: Finished difference Result 3090 states and 4269 transitions. [2025-03-08 19:12:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:12:40,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-08 19:12:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:40,287 INFO L225 Difference]: With dead ends: 3090 [2025-03-08 19:12:40,288 INFO L226 Difference]: Without dead ends: 1568 [2025-03-08 19:12:40,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:40,293 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 1113 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:40,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2224 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-08 19:12:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1562. [2025-03-08 19:12:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1112 states have (on average 1.3201438848920863) internal successors, (1468), 1130 states have internal predecessors, (1468), 345 states have call successors, (345), 105 states have call predecessors, (345), 104 states have return successors, (344), 342 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-08 19:12:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2157 transitions. [2025-03-08 19:12:40,387 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2157 transitions. Word has length 107 [2025-03-08 19:12:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:40,389 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2157 transitions. [2025-03-08 19:12:40,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 19:12:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2157 transitions. [2025-03-08 19:12:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 19:12:40,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:40,394 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:40,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:12:40,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:40,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -685069209, now seen corresponding path program 1 times [2025-03-08 19:12:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691880501] [2025-03-08 19:12:40,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:40,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 19:12:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 19:12:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-08 19:12:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691880501] [2025-03-08 19:12:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691880501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:41,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:41,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:12:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940813123] [2025-03-08 19:12:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:41,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:12:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:41,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:12:41,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:12:41,044 INFO L87 Difference]: Start difference. First operand 1562 states and 2157 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 19:12:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:41,426 INFO L93 Difference]: Finished difference Result 4607 states and 6401 transitions. [2025-03-08 19:12:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:12:41,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-08 19:12:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:41,450 INFO L225 Difference]: With dead ends: 4607 [2025-03-08 19:12:41,450 INFO L226 Difference]: Without dead ends: 3077 [2025-03-08 19:12:41,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:12:41,460 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 1086 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 4508 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:41,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 4508 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:12:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2025-03-08 19:12:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3073. [2025-03-08 19:12:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 2190 states have (on average 1.3214611872146118) internal successors, (2894), 2226 states have internal predecessors, (2894), 676 states have call successors, (676), 207 states have call predecessors, (676), 206 states have return successors, (695), 671 states have call predecessors, (695), 675 states have call successors, (695) [2025-03-08 19:12:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4265 transitions. [2025-03-08 19:12:41,627 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4265 transitions. Word has length 112 [2025-03-08 19:12:41,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 3073 states and 4265 transitions. [2025-03-08 19:12:41,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 19:12:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4265 transitions. [2025-03-08 19:12:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-08 19:12:41,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:41,639 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:12:41,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash 316158111, now seen corresponding path program 1 times [2025-03-08 19:12:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036105856] [2025-03-08 19:12:41,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:41,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 19:12:41,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 19:12:41,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:41,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-08 19:12:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:42,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036105856] [2025-03-08 19:12:42,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036105856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:42,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:42,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658236462] [2025-03-08 19:12:42,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:42,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:42,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:42,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:42,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:42,056 INFO L87 Difference]: Start difference. First operand 3073 states and 4265 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:42,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:42,311 INFO L93 Difference]: Finished difference Result 8037 states and 11104 transitions. [2025-03-08 19:12:42,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:42,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 242 [2025-03-08 19:12:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:42,336 INFO L225 Difference]: With dead ends: 8037 [2025-03-08 19:12:42,337 INFO L226 Difference]: Without dead ends: 5002 [2025-03-08 19:12:42,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:42,346 INFO L435 NwaCegarLoop]: 1156 mSDtfsCounter, 707 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:42,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 2189 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:12:42,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2025-03-08 19:12:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4991. [2025-03-08 19:12:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 3540 states have (on average 1.3245762711864406) internal successors, (4689), 3592 states have internal predecessors, (4689), 1076 states have call successors, (1076), 375 states have call predecessors, (1076), 374 states have return successors, (1111), 1071 states have call predecessors, (1111), 1075 states have call successors, (1111) [2025-03-08 19:12:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 6876 transitions. [2025-03-08 19:12:42,572 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 6876 transitions. Word has length 242 [2025-03-08 19:12:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:42,572 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 6876 transitions. [2025-03-08 19:12:42,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 6876 transitions. [2025-03-08 19:12:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 19:12:42,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:42,593 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:42,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:12:42,593 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1815620881, now seen corresponding path program 1 times [2025-03-08 19:12:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583136416] [2025-03-08 19:12:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:42,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:42,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 19:12:42,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 19:12:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:42,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-08 19:12:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583136416] [2025-03-08 19:12:42,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583136416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:42,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:42,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:42,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225414507] [2025-03-08 19:12:42,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:42,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:42,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:42,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:42,988 INFO L87 Difference]: Start difference. First operand 4991 states and 6876 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:43,406 INFO L93 Difference]: Finished difference Result 11820 states and 16203 transitions. [2025-03-08 19:12:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 224 [2025-03-08 19:12:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:43,441 INFO L225 Difference]: With dead ends: 11820 [2025-03-08 19:12:43,441 INFO L226 Difference]: Without dead ends: 6867 [2025-03-08 19:12:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:43,455 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 658 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:43,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2249 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 19:12:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6867 states. [2025-03-08 19:12:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6867 to 6854. [2025-03-08 19:12:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6854 states, 4896 states have (on average 1.3131127450980393) internal successors, (6429), 4980 states have internal predecessors, (6429), 1441 states have call successors, (1441), 517 states have call predecessors, (1441), 516 states have return successors, (1488), 1432 states have call predecessors, (1488), 1440 states have call successors, (1488) [2025-03-08 19:12:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 9358 transitions. [2025-03-08 19:12:43,783 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 9358 transitions. Word has length 224 [2025-03-08 19:12:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:43,783 INFO L471 AbstractCegarLoop]: Abstraction has 6854 states and 9358 transitions. [2025-03-08 19:12:43,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 9358 transitions. [2025-03-08 19:12:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-08 19:12:43,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:43,801 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:43,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:12:43,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:43,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:43,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1944762741, now seen corresponding path program 1 times [2025-03-08 19:12:43,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:43,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110186202] [2025-03-08 19:12:43,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:43,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-08 19:12:44,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 19:12:44,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:44,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-08 19:12:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110186202] [2025-03-08 19:12:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110186202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:44,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808932643] [2025-03-08 19:12:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:44,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:44,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:44,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:44,362 INFO L87 Difference]: Start difference. First operand 6854 states and 9358 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 19:12:48,381 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-08 19:12:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:48,697 INFO L93 Difference]: Finished difference Result 16292 states and 22178 transitions. [2025-03-08 19:12:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 253 [2025-03-08 19:12:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:48,746 INFO L225 Difference]: With dead ends: 16292 [2025-03-08 19:12:48,747 INFO L226 Difference]: Without dead ends: 9487 [2025-03-08 19:12:48,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:48,773 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 973 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:48,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1955 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 19:12:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2025-03-08 19:12:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 9472. [2025-03-08 19:12:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9472 states, 6770 states have (on average 1.3091580502215658) internal successors, (8863), 6878 states have internal predecessors, (8863), 1943 states have call successors, (1943), 759 states have call predecessors, (1943), 758 states have return successors, (2006), 1934 states have call predecessors, (2006), 1942 states have call successors, (2006) [2025-03-08 19:12:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 12812 transitions. [2025-03-08 19:12:49,121 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 12812 transitions. Word has length 253 [2025-03-08 19:12:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 9472 states and 12812 transitions. [2025-03-08 19:12:49,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 19:12:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 12812 transitions. [2025-03-08 19:12:49,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 19:12:49,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:49,137 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:49,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:12:49,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -990518117, now seen corresponding path program 1 times [2025-03-08 19:12:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:49,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158737161] [2025-03-08 19:12:49,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:49,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 19:12:49,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 19:12:49,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:49,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-08 19:12:49,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:49,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158737161] [2025-03-08 19:12:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158737161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:49,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472160452] [2025-03-08 19:12:49,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:49,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:49,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:49,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:49,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:49,565 INFO L87 Difference]: Start difference. First operand 9472 states and 12812 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 19:12:53,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:12:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:54,092 INFO L93 Difference]: Finished difference Result 24946 states and 33746 transitions. [2025-03-08 19:12:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 235 [2025-03-08 19:12:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:54,168 INFO L225 Difference]: With dead ends: 24946 [2025-03-08 19:12:54,169 INFO L226 Difference]: Without dead ends: 15523 [2025-03-08 19:12:54,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:54,201 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 910 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:54,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2607 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 19:12:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15523 states. [2025-03-08 19:12:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15523 to 15510. [2025-03-08 19:12:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15510 states, 11200 states have (on average 1.2904464285714285) internal successors, (14453), 11380 states have internal predecessors, (14453), 3007 states have call successors, (3007), 1303 states have call predecessors, (3007), 1302 states have return successors, (3104), 2994 states have call predecessors, (3104), 3006 states have call successors, (3104) [2025-03-08 19:12:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 20564 transitions. [2025-03-08 19:12:54,882 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 20564 transitions. Word has length 235 [2025-03-08 19:12:54,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:54,882 INFO L471 AbstractCegarLoop]: Abstraction has 15510 states and 20564 transitions. [2025-03-08 19:12:54,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 19:12:54,883 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 20564 transitions. [2025-03-08 19:12:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 19:12:54,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:54,902 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:12:54,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash -798356341, now seen corresponding path program 1 times [2025-03-08 19:12:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:54,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263141592] [2025-03-08 19:12:54,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:55,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 19:12:55,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 19:12:55,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:55,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 19:12:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263141592] [2025-03-08 19:12:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263141592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:12:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186417844] [2025-03-08 19:12:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:12:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:55,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:12:55,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:55,313 INFO L87 Difference]: Start difference. First operand 15510 states and 20564 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:12:55,630 INFO L93 Difference]: Finished difference Result 23287 states and 31028 transitions. [2025-03-08 19:12:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:12:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 234 [2025-03-08 19:12:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:12:55,689 INFO L225 Difference]: With dead ends: 23287 [2025-03-08 19:12:55,690 INFO L226 Difference]: Without dead ends: 15538 [2025-03-08 19:12:55,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:12:55,715 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 2 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:12:55,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:12:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15538 states. [2025-03-08 19:12:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15538 to 15538. [2025-03-08 19:12:56,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15538 states, 11228 states have (on average 1.2897221232632703) internal successors, (14481), 11408 states have internal predecessors, (14481), 3007 states have call successors, (3007), 1303 states have call predecessors, (3007), 1302 states have return successors, (3104), 2994 states have call predecessors, (3104), 3006 states have call successors, (3104) [2025-03-08 19:12:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15538 states to 15538 states and 20592 transitions. [2025-03-08 19:12:56,233 INFO L78 Accepts]: Start accepts. Automaton has 15538 states and 20592 transitions. Word has length 234 [2025-03-08 19:12:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:12:56,233 INFO L471 AbstractCegarLoop]: Abstraction has 15538 states and 20592 transitions. [2025-03-08 19:12:56,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:12:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15538 states and 20592 transitions. [2025-03-08 19:12:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 19:12:56,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:12:56,250 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:12:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:12:56,250 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:12:56,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:12:56,250 INFO L85 PathProgramCache]: Analyzing trace with hash 811034492, now seen corresponding path program 1 times [2025-03-08 19:12:56,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:12:56,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334378749] [2025-03-08 19:12:56,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:12:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:12:56,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 19:12:56,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 19:12:56,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:12:56,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:12:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 19:12:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:12:57,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334378749] [2025-03-08 19:12:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334378749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:12:57,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:12:57,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 19:12:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256384151] [2025-03-08 19:12:57,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:12:57,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 19:12:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:12:57,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 19:12:57,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 19:12:57,118 INFO L87 Difference]: Start difference. First operand 15538 states and 20592 transitions. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-08 19:13:01,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:05,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:09,493 INFO L93 Difference]: Finished difference Result 33903 states and 45132 transitions. [2025-03-08 19:13:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 19:13:09,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) Word has length 235 [2025-03-08 19:13:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:09,559 INFO L225 Difference]: With dead ends: 33903 [2025-03-08 19:13:09,559 INFO L226 Difference]: Without dead ends: 18414 [2025-03-08 19:13:09,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 19:13:09,589 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 2063 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 3141 mSolverCounterSat, 677 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 3141 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:09,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 2765 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 3141 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2025-03-08 19:13:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2025-03-08 19:13:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 18088. [2025-03-08 19:13:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18088 states, 12786 states have (on average 1.2739715313624276) internal successors, (16289), 13078 states have internal predecessors, (16289), 3651 states have call successors, (3651), 1569 states have call predecessors, (3651), 1650 states have return successors, (3958), 3650 states have call predecessors, (3958), 3650 states have call successors, (3958) [2025-03-08 19:13:10,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18088 states to 18088 states and 23898 transitions. [2025-03-08 19:13:10,369 INFO L78 Accepts]: Start accepts. Automaton has 18088 states and 23898 transitions. Word has length 235 [2025-03-08 19:13:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 18088 states and 23898 transitions. [2025-03-08 19:13:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 8 states have internal predecessors, (124), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-08 19:13:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 18088 states and 23898 transitions. [2025-03-08 19:13:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 19:13:10,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:10,387 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:10,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:13:10,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:10,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1713164197, now seen corresponding path program 1 times [2025-03-08 19:13:10,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:10,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053027304] [2025-03-08 19:13:10,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:10,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:10,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 19:13:10,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 19:13:10,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:10,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-08 19:13:11,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:11,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053027304] [2025-03-08 19:13:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053027304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:11,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:11,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:13:11,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89689155] [2025-03-08 19:13:11,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:11,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:13:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:11,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:13:11,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:13:11,036 INFO L87 Difference]: Start difference. First operand 18088 states and 23898 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:13:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:11,550 INFO L93 Difference]: Finished difference Result 36301 states and 48316 transitions. [2025-03-08 19:13:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:13:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 235 [2025-03-08 19:13:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:11,631 INFO L225 Difference]: With dead ends: 36301 [2025-03-08 19:13:11,631 INFO L226 Difference]: Without dead ends: 18262 [2025-03-08 19:13:11,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:13:11,676 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 0 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:11,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:13:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18262 states. [2025-03-08 19:13:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18262 to 18256. [2025-03-08 19:13:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18256 states, 12912 states have (on average 1.2712980173482031) internal successors, (16415), 13204 states have internal predecessors, (16415), 3651 states have call successors, (3651), 1569 states have call predecessors, (3651), 1692 states have return successors, (4006), 3692 states have call predecessors, (4006), 3650 states have call successors, (4006) [2025-03-08 19:13:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18256 states to 18256 states and 24072 transitions. [2025-03-08 19:13:12,240 INFO L78 Accepts]: Start accepts. Automaton has 18256 states and 24072 transitions. Word has length 235 [2025-03-08 19:13:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 18256 states and 24072 transitions. [2025-03-08 19:13:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 19:13:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 18256 states and 24072 transitions. [2025-03-08 19:13:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-08 19:13:12,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:12,257 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:12,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 19:13:12,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -225157201, now seen corresponding path program 1 times [2025-03-08 19:13:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670169464] [2025-03-08 19:13:12,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:12,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 19:13:12,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 19:13:12,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:12,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 19:13:12,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:12,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670169464] [2025-03-08 19:13:12,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670169464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:12,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:13:12,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487211746] [2025-03-08 19:13:12,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:13:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:12,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:13:12,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:13:12,877 INFO L87 Difference]: Start difference. First operand 18256 states and 24072 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 19:13:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:13,537 INFO L93 Difference]: Finished difference Result 36535 states and 48262 transitions. [2025-03-08 19:13:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:13:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) Word has length 242 [2025-03-08 19:13:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:13,641 INFO L225 Difference]: With dead ends: 36535 [2025-03-08 19:13:13,642 INFO L226 Difference]: Without dead ends: 18328 [2025-03-08 19:13:13,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:13:13,696 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 1 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:13,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2208 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:13:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18328 states. [2025-03-08 19:13:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18328 to 18292. [2025-03-08 19:13:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18292 states, 12948 states have (on average 1.2705437133147977) internal successors, (16451), 13240 states have internal predecessors, (16451), 3651 states have call successors, (3651), 1569 states have call predecessors, (3651), 1692 states have return successors, (4006), 3692 states have call predecessors, (4006), 3650 states have call successors, (4006) [2025-03-08 19:13:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18292 states to 18292 states and 24108 transitions. [2025-03-08 19:13:14,345 INFO L78 Accepts]: Start accepts. Automaton has 18292 states and 24108 transitions. Word has length 242 [2025-03-08 19:13:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:14,346 INFO L471 AbstractCegarLoop]: Abstraction has 18292 states and 24108 transitions. [2025-03-08 19:13:14,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-08 19:13:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18292 states and 24108 transitions. [2025-03-08 19:13:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-08 19:13:14,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:14,357 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:14,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 19:13:14,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash -914015667, now seen corresponding path program 1 times [2025-03-08 19:13:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622191525] [2025-03-08 19:13:14,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:14,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 19:13:14,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 19:13:14,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:14,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-08 19:13:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622191525] [2025-03-08 19:13:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622191525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763699416] [2025-03-08 19:13:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:14,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:14,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:13:14,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:13:15,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 19:13:15,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 19:13:15,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:15,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:15,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 2370 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 19:13:15,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 19:13:16,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:13:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 19:13:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763699416] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 19:13:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 9] total 17 [2025-03-08 19:13:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97276909] [2025-03-08 19:13:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:17,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 19:13:17,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:17,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 19:13:17,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-08 19:13:17,391 INFO L87 Difference]: Start difference. First operand 18292 states and 24108 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-08 19:13:21,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:25,425 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-08 19:13:29,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 19:13:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:35,819 INFO L93 Difference]: Finished difference Result 46740 states and 64440 transitions. [2025-03-08 19:13:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 19:13:35,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) Word has length 244 [2025-03-08 19:13:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:36,002 INFO L225 Difference]: With dead ends: 46740 [2025-03-08 19:13:36,002 INFO L226 Difference]: Without dead ends: 36263 [2025-03-08 19:13:36,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2025-03-08 19:13:36,063 INFO L435 NwaCegarLoop]: 1568 mSDtfsCounter, 4279 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 3500 mSolverCounterSat, 1461 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4474 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 4964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 3500 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4474 Valid, 4386 Invalid, 4964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 3500 Invalid, 3 Unknown, 0 Unchecked, 17.2s Time] [2025-03-08 19:13:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36263 states. [2025-03-08 19:13:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36263 to 27598. [2025-03-08 19:13:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27598 states, 19529 states have (on average 1.2696502637103795) internal successors, (24795), 20037 states have internal predecessors, (24795), 5441 states have call successors, (5441), 2274 states have call predecessors, (5441), 2627 states have return successors, (6457), 5622 states have call predecessors, (6457), 5440 states have call successors, (6457) [2025-03-08 19:13:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27598 states to 27598 states and 36693 transitions. [2025-03-08 19:13:37,529 INFO L78 Accepts]: Start accepts. Automaton has 27598 states and 36693 transitions. Word has length 244 [2025-03-08 19:13:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:37,530 INFO L471 AbstractCegarLoop]: Abstraction has 27598 states and 36693 transitions. [2025-03-08 19:13:37,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-08 19:13:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 27598 states and 36693 transitions. [2025-03-08 19:13:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-08 19:13:37,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:37,551 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:37,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:13:37,755 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,SelfDestructingSolverStorable11 [2025-03-08 19:13:37,756 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:37,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 171522302, now seen corresponding path program 1 times [2025-03-08 19:13:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:37,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694185467] [2025-03-08 19:13:37,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:38,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-08 19:13:38,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-08 19:13:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 19:13:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694185467] [2025-03-08 19:13:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694185467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:13:38,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:13:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:13:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938790991] [2025-03-08 19:13:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:13:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:13:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:38,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:13:38,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:13:38,554 INFO L87 Difference]: Start difference. First operand 27598 states and 36693 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 19:13:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:13:40,031 INFO L93 Difference]: Finished difference Result 47437 states and 63621 transitions. [2025-03-08 19:13:40,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:13:40,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 245 [2025-03-08 19:13:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:13:40,245 INFO L225 Difference]: With dead ends: 47437 [2025-03-08 19:13:40,245 INFO L226 Difference]: Without dead ends: 27654 [2025-03-08 19:13:40,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:13:40,338 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 0 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:13:40,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3304 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:13:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27654 states. [2025-03-08 19:13:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27654 to 27640. [2025-03-08 19:13:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27640 states, 19571 states have (on average 1.2705022737724183) internal successors, (24865), 20079 states have internal predecessors, (24865), 5441 states have call successors, (5441), 2274 states have call predecessors, (5441), 2627 states have return successors, (6457), 5622 states have call predecessors, (6457), 5440 states have call successors, (6457) [2025-03-08 19:13:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27640 states to 27640 states and 36763 transitions. [2025-03-08 19:13:41,760 INFO L78 Accepts]: Start accepts. Automaton has 27640 states and 36763 transitions. Word has length 245 [2025-03-08 19:13:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:13:41,760 INFO L471 AbstractCegarLoop]: Abstraction has 27640 states and 36763 transitions. [2025-03-08 19:13:41,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 19:13:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27640 states and 36763 transitions. [2025-03-08 19:13:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-08 19:13:41,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:13:41,773 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:13:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:13:41,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:13:41,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:13:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1319350071, now seen corresponding path program 1 times [2025-03-08 19:13:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:13:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845623275] [2025-03-08 19:13:41,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:13:41,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 19:13:42,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 19:13:42,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:42,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 19:13:42,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:13:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845623275] [2025-03-08 19:13:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845623275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:13:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781764838] [2025-03-08 19:13:42,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:13:42,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:13:42,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:13:42,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:13:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:13:42,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 19:13:43,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 19:13:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:13:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:13:43,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 2378 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:13:43,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:13:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 19:13:43,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:13:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-08 19:13:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781764838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:13:43,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:13:43,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 19:13:43,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593021915] [2025-03-08 19:13:43,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:13:43,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 19:13:43,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:13:43,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 19:13:43,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:13:43,341 INFO L87 Difference]: Start difference. First operand 27640 states and 36763 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32)